Base | Representation |
---|---|
bin | 101010010101000… |
… | …1000010011100011 |
3 | 10122222121020202122 |
4 | 1110222020103203 |
5 | 10402101031321 |
6 | 352534334455 |
7 | 50124415256 |
oct | 12452102343 |
9 | 3588536678 |
10 | 1420330211 |
11 | 669815123 |
12 | 3377ba42b |
13 | 1983492a1 |
14 | d68c509d |
15 | 84a5d8ab |
hex | 54a884e3 |
1420330211 has 4 divisors (see below), whose sum is σ = 1458717552. Its totient is φ = 1381942872.
The previous prime is 1420330181. The next prime is 1420330243. The reversal of 1420330211 is 1120330241.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1420330211 - 222 = 1416135907 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1420330211.
It is not an unprimeable number, because it can be changed into a prime (1420330111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19193615 + ... + 19193688.
It is an arithmetic number, because the mean of its divisors is an integer number (364679388).
Almost surely, 21420330211 is an apocalyptic number.
1420330211 is a deficient number, since it is larger than the sum of its proper divisors (38387341).
1420330211 is an equidigital number, since it uses as much as digits as its factorization.
1420330211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38387340.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1420330211 is about 37687.2685531865. The cubic root of 1420330211 is about 1124.0779832483.
Adding to 1420330211 its reverse (1120330241), we get a palindrome (2540660452).
The spelling of 1420330211 in words is "one billion, four hundred twenty million, three hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •