Base | Representation |
---|---|
bin | 11011010011111110101011… |
… | …000011100101001101010001 |
3 | 120202022101021200022110202212 |
4 | 123103332223003211031101 |
5 | 111221022202333210001 |
6 | 1103250244541121505 |
7 | 34205254015126214 |
oct | 3323765303451521 |
9 | 522271250273685 |
10 | 120120220210001 |
11 | 35301776865370 |
12 | 1158012a859295 |
13 | 52043991261cb |
14 | 2193bc773977b |
15 | dd4908b087bb |
hex | 6d3fab0e5351 |
120120220210001 has 16 divisors (see below), whose sum is σ = 131643031595328. Its totient is φ = 108698694196800.
The previous prime is 120120220209971. The next prime is 120120220210013. The reversal of 120120220210001 is 100012022021021.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120120220210001 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (120120220210301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17573666 + ... + 23432331.
It is an arithmetic number, because the mean of its divisors is an integer number (8227689474708).
Almost surely, 2120120220210001 is an apocalyptic number.
120120220210001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120120220210001 is a deficient number, since it is larger than the sum of its proper divisors (11522811385327).
120120220210001 is a wasteful number, since it uses less digits than its factorization.
120120220210001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41007232.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120120220210001 its reverse (100012022021021), we get a palindrome (220132242231022).
The spelling of 120120220210001 in words is "one hundred twenty trillion, one hundred twenty billion, two hundred twenty million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •