Base | Representation |
---|---|
bin | 1001001101000100110000… |
… | …1000011001101011011010 |
3 | 1022211111001112210012112122 |
4 | 2103101030020121223122 |
5 | 2311302202334020442 |
6 | 33305055345341242 |
7 | 2063106330351005 |
oct | 223211410315332 |
9 | 38744045705478 |
10 | 10120220220122 |
11 | 3251a63531841 |
12 | 1175449337822 |
13 | 585442b5954c |
14 | 26db6d7dc53c |
15 | 1283b43e8dd2 |
hex | 9344c219ada |
10120220220122 has 8 divisors (see below), whose sum is σ = 15192034520916. Its totient is φ = 5056208713152.
The previous prime is 10120220220113. The next prime is 10120220220127. The reversal of 10120220220122 is 22102202202101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 6403070924041 + 3717149296081 = 2530429^2 + 1927991^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10120220220122.
It is not an unprimeable number, because it can be changed into a prime (10120220220127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1950695213 + ... + 1950700400.
Almost surely, 210120220220122 is an apocalyptic number.
10120220220122 is a deficient number, since it is larger than the sum of its proper divisors (5071814300794).
10120220220122 is a wasteful number, since it uses less digits than its factorization.
10120220220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3901396912.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 10120220220122 its reverse (22102202202101), we get a palindrome (32222422422223).
The spelling of 10120220220122 in words is "ten trillion, one hundred twenty billion, two hundred twenty million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •