Base | Representation |
---|---|
bin | 1001001001100100101001… |
… | …00111001001000100110111 |
3 | 2122020110112202121222210201 |
4 | 10210302110213021010313 |
5 | 10114122001221300343 |
6 | 110443020000501331 |
7 | 4144426222035310 |
oct | 444622447110467 |
9 | 78213482558721 |
10 | 20120120103223 |
11 | 64579932a4518 |
12 | 230b4b761a847 |
13 | b2c41c32ccaa |
14 | 4d7b67509607 |
15 | 24d58566294d |
hex | 124c949c9137 |
20120120103223 has 8 divisors (see below), whose sum is σ = 23271464216448. Its totient is φ = 17038036300344.
The previous prime is 20120120103197. The next prime is 20120120103227. The reversal of 20120120103223 is 32230102102102.
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 20120120103223 - 221 = 20120118006071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20120120103223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120120103227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17315076961 + ... + 17315078122.
It is an arithmetic number, because the mean of its divisors is an integer number (2908933027056).
Almost surely, 220120120103223 is an apocalyptic number.
20120120103223 is a deficient number, since it is larger than the sum of its proper divisors (3151344113225).
20120120103223 is an equidigital number, since it uses as much as digits as its factorization.
20120120103223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34630155173.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20120120103223 its reverse (32230102102102), we get a palindrome (52350222205325).
The spelling of 20120120103223 in words is "twenty trillion, one hundred twenty billion, one hundred twenty million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •