Base | Representation |
---|---|
bin | 110111111011110110… |
… | …1111001001011000001 |
3 | 102111001101012100011101 |
4 | 1233313231321023001 |
5 | 3432001222320001 |
6 | 131103223014401 |
7 | 11451455113330 |
oct | 1576755711301 |
9 | 374041170141 |
10 | 120120120001 |
11 | 46a40749052 |
12 | 1b343b9a401 |
13 | b434053aab |
14 | 5b57293d17 |
15 | 31d07d1a01 |
hex | 1bf7b792c1 |
120120120001 has 8 divisors (see below), whose sum is σ = 144505407680. Its totient is φ = 97541149968.
The previous prime is 120120119969. The next prime is 120120120007. The reversal of 120120120001 is 100021021021.
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 120120120001 - 25 = 120120119969 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120120120001.
It is not an unprimeable number, because it can be changed into a prime (120120120007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451579266 + ... + 451579531.
It is an arithmetic number, because the mean of its divisors is an integer number (18063175960).
Almost surely, 2120120120001 is an apocalyptic number.
It is an amenable number.
120120120001 is a deficient number, since it is larger than the sum of its proper divisors (24385287679).
120120120001 is an equidigital number, since it uses as much as digits as its factorization.
120120120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903158823.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 120120120001 its reverse (100021021021), we get a palindrome (220141141022).
The spelling of 120120120001 in words is "one hundred twenty billion, one hundred twenty million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •