Base | Representation |
---|---|
bin | 1001001100010100001001… |
… | …01111100000101101000011 |
3 | 2122120110202022220022100110 |
4 | 10212022010233200231003 |
5 | 10122142433321022321 |
6 | 110554201355322403 |
7 | 4154303160460011 |
oct | 446120457405503 |
9 | 78513668808313 |
10 | 20214343142211 |
11 | 6493944798279 |
12 | 2325812750403 |
13 | b382870366ba |
14 | 4dc5452198b1 |
15 | 250c4c620176 |
hex | 126284be0b43 |
20214343142211 has 8 divisors (see below), whose sum is σ = 27332069601024. Its totient is φ = 13286422722440.
The previous prime is 20214343142131. The next prime is 20214343142233. The reversal of 20214343142211 is 11224134341202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20214343142211 - 211 = 20214343140163 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20214343142251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47451509511 + ... + 47451509936.
It is an arithmetic number, because the mean of its divisors is an integer number (3416508700128).
Almost surely, 220214343142211 is an apocalyptic number.
20214343142211 is a deficient number, since it is larger than the sum of its proper divisors (7117726458813).
20214343142211 is an equidigital number, since it uses as much as digits as its factorization.
20214343142211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94903019521.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 20214343142211 its reverse (11224134341202), we get a palindrome (31438477483413).
The spelling of 20214343142211 in words is "twenty trillion, two hundred fourteen billion, three hundred forty-three million, one hundred forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •