Base | Representation |
---|---|
bin | 11011010010011000001110… |
… | …101010001010110100010011 |
3 | 120201220212100201111112201022 |
4 | 123102120032222022310103 |
5 | 111212221413330321321 |
6 | 1103123533540230055 |
7 | 34164311115602663 |
oct | 3322301652126423 |
9 | 521825321445638 |
10 | 120010222120211 |
11 | 3526a05a7aa445 |
12 | 1156295069b32b |
13 | 51c6bb9147907 |
14 | 218c7508d21a3 |
15 | dd1b1bc8bdab |
hex | 6d260ea8ad13 |
120010222120211 has 8 divisors (see below), whose sum is σ = 125264282436384. Its totient is φ = 114759180518400.
The previous prime is 120010222120163. The next prime is 120010222120213. The reversal of 120010222120211 is 112021222010021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120010222120211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120010222120211.
It is not an unprimeable number, because it can be changed into a prime (120010222120213) 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, 754597340 + ... + 754756361.
It is an arithmetic number, because the mean of its divisors is an integer number (15658035304548).
Almost surely, 2120010222120211 is an apocalyptic number.
120010222120211 is a deficient number, since it is larger than the sum of its proper divisors (5254060316173).
120010222120211 is a wasteful number, since it uses less digits than its factorization.
120010222120211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1509357181.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120010222120211 its reverse (112021222010021), we get a palindrome (232031444130232).
The spelling of 120010222120211 in words is "one hundred twenty trillion, ten billion, two hundred twenty-two million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •