Base | Representation |
---|---|
bin | 1001001001101010000011… |
… | …01001101000001010010001 |
3 | 2122020202001002100021000111 |
4 | 10210311001221220022101 |
5 | 10114143422420310301 |
6 | 110444220024321321 |
7 | 4144561163050636 |
oct | 444650151501221 |
9 | 78222032307014 |
10 | 20123023213201 |
11 | 6459142aa7a67 |
12 | 230bb87913241 |
13 | b2c79291c44c |
14 | 4d7d60cd018d |
15 | 24d6a5468551 |
hex | 124d41a68291 |
20123023213201 has 8 divisors (see below), whose sum is σ = 20776607819264. Its totient is φ = 19469717033760.
The previous prime is 20123023213187. The next prime is 20123023213207. The reversal of 20123023213201 is 10231232032102.
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 20123023213201 - 25 = 20123023213169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20123023213207) 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, 69459756 + ... + 69748861.
It is an arithmetic number, because the mean of its divisors is an integer number (2597075977408).
Almost surely, 220123023213201 is an apocalyptic number.
It is an amenable number.
20123023213201 is a deficient number, since it is larger than the sum of its proper divisors (653584606063).
20123023213201 is a wasteful number, since it uses less digits than its factorization.
20123023213201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139213311.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 20123023213201 its reverse (10231232032102), we get a palindrome (30354255245303).
The spelling of 20123023213201 in words is "twenty trillion, one hundred twenty-three billion, twenty-three million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •