Base | Representation |
---|---|
bin | 11011010010001111110000… |
… | …010000000000111111001010 |
3 | 120201212222212112001012121022 |
4 | 123102033300100000333022 |
5 | 111212044244213410010 |
6 | 1103115430541312442 |
7 | 34163536446142361 |
oct | 3322176020007712 |
9 | 521788775035538 |
10 | 120001122013130 |
11 | 3526620aa54296 |
12 | 11561030b65722 |
13 | 51c6098a17177 |
14 | 218c12a09c7d8 |
15 | dd1787dd8d55 |
hex | 6d23f0400fca |
120001122013130 has 32 divisors (see below), whose sum is σ = 218739959101440. Its totient is φ = 47392038570240.
The previous prime is 120001122013103. The next prime is 120001122013169. The reversal of 120001122013130 is 31310221100021.
It is a super-2 number, since 2×1200011220131302 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120001122013099 and 120001122013108.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46070087 + ... + 48605093.
It is an arithmetic number, because the mean of its divisors is an integer number (6835623721920).
Almost surely, 2120001122013130 is an apocalyptic number.
120001122013130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120001122013130 is a deficient number, since it is larger than the sum of its proper divisors (98738837088310).
120001122013130 is a wasteful number, since it uses less digits than its factorization.
120001122013130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2595014.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120001122013130 its reverse (31310221100021), we get a palindrome (151311343113151).
The spelling of 120001122013130 in words is "one hundred twenty trillion, one billion, one hundred twenty-two million, thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •