Base | Representation |
---|---|
bin | 11011010011111111100000… |
… | …110011101001000100111011 |
3 | 120202022110121112012012202022 |
4 | 123103333200303221010323 |
5 | 111221031024213014321 |
6 | 1103250514233425055 |
7 | 34205315245205132 |
oct | 3323774063510473 |
9 | 522273545165668 |
10 | 120121122001211 |
11 | 35302099900461 |
12 | 1158034086b18b |
13 | 52044b0bc8c86 |
14 | 2193c71400919 |
15 | dd495cd8adab |
hex | 6d3fe0ce913b |
120121122001211 has 4 divisors (see below), whose sum is σ = 120123429102312. Its totient is φ = 120118814900112.
The previous prime is 120121122001193. The next prime is 120121122001297. The reversal of 120121122001211 is 112100221121021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120121122001211 - 26 = 120121122001147 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 120121122001211.
It is not an unprimeable number, because it can be changed into a prime (120121122001411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1153472450 + ... + 1153576583.
It is an arithmetic number, because the mean of its divisors is an integer number (30030857275578).
Almost surely, 2120121122001211 is an apocalyptic number.
120121122001211 is a deficient number, since it is larger than the sum of its proper divisors (2307101101).
120121122001211 is an equidigital number, since it uses as much as digits as its factorization.
120121122001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2307101100.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 120121122001211 its reverse (112100221121021), we get a palindrome (232221343122232).
The spelling of 120121122001211 in words is "one hundred twenty trillion, one hundred twenty-one billion, one hundred twenty-two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •