Base | Representation |
---|---|
bin | 10011100101000001… |
… | …110000011101111001 |
3 | 2000021002012010002202 |
4 | 103211001300131321 |
5 | 321023202443223 |
6 | 13354005035545 |
7 | 1342644464162 |
oct | 234501603571 |
9 | 60232163082 |
10 | 21022312313 |
11 | 8a08602432 |
12 | 40a83b5bb5 |
13 | 1ca0427872 |
14 | 1035da0769 |
15 | 8308a8428 |
hex | 4e5070779 |
21022312313 has 8 divisors (see below), whose sum is σ = 21324730368. Its totient is φ = 20720284704.
The previous prime is 21022312303. The next prime is 21022312343. The reversal of 21022312313 is 31321322012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21022312313 is a prime.
It is a super-2 number, since 2×210223123132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21022312303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11720 + ... + 205382.
It is an arithmetic number, because the mean of its divisors is an integer number (2665591296).
Almost surely, 221022312313 is an apocalyptic number.
It is an amenable number.
21022312313 is a deficient number, since it is larger than the sum of its proper divisors (302418055).
21022312313 is a wasteful number, since it uses less digits than its factorization.
21022312313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195223.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21022312313 its reverse (31321322012), we get a palindrome (52343634325).
The spelling of 21022312313 in words is "twenty-one billion, twenty-two million, three hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •