Base | Representation |
---|---|
bin | 1001001100100100101001… |
… | …01001110010101100101101 |
3 | 2122121022121120122222010122 |
4 | 10212102110221302230231 |
5 | 10122314103200404401 |
6 | 111002224305014325 |
7 | 4155035514566021 |
oct | 446222451625455 |
9 | 78538546588118 |
10 | 20223200013101 |
11 | 649767a20a488 |
12 | 23274849243a5 |
13 | b39068c522c7 |
14 | 4dcb45614381 |
15 | 2510b9e7821b |
hex | 126494a72b2d |
20223200013101 has 16 divisors (see below), whose sum is σ = 21236564029824. Its totient is φ = 19221244483584.
The previous prime is 20223200013097. The next prime is 20223200013127. The reversal of 20223200013101 is 10131000232202.
It is a cyclic number.
It is not a de Polignac number, because 20223200013101 - 22 = 20223200013097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20223200013101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20223200013161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1146230 + ... + 6462216.
It is an arithmetic number, because the mean of its divisors is an integer number (1327285251864).
Almost surely, 220223200013101 is an apocalyptic number.
It is an amenable number.
20223200013101 is a deficient number, since it is larger than the sum of its proper divisors (1013364016723).
20223200013101 is a wasteful number, since it uses less digits than its factorization.
20223200013101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5317060.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20223200013101 its reverse (10131000232202), we get a palindrome (30354200245303).
The spelling of 20223200013101 in words is "twenty trillion, two hundred twenty-three billion, two hundred million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •