Base | Representation |
---|---|
bin | 1001010010011000111111… |
… | …00111101111001111101111 |
3 | 2200022102120221202121222202 |
4 | 10221030133213233033233 |
5 | 10134103002100101221 |
6 | 111234124223332115 |
7 | 4205343312510215 |
oct | 451143747571757 |
9 | 80272527677882 |
10 | 20423100003311 |
11 | 656442a582865 |
12 | 235a172a5103b |
13 | b51b75626395 |
14 | 5086aa300cb5 |
15 | 2563b9744d0b |
hex | 12931f9ef3ef |
20423100003311 has 4 divisors (see below), whose sum is σ = 20424917178000. Its totient is φ = 20421282828624.
The previous prime is 20423100003301. The next prime is 20423100003331. The reversal of 20423100003311 is 11330000132402.
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 20423100003311 - 210 = 20423100002287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20423100003301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 908570486 + ... + 908592963.
It is an arithmetic number, because the mean of its divisors is an integer number (5106229294500).
Almost surely, 220423100003311 is an apocalyptic number.
20423100003311 is a deficient number, since it is larger than the sum of its proper divisors (1817174689).
20423100003311 is a wasteful number, since it uses less digits than its factorization.
20423100003311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1817174688.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20423100003311 its reverse (11330000132402), we get a palindrome (31753100135713).
The spelling of 20423100003311 in words is "twenty trillion, four hundred twenty-three billion, one hundred million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •