Base | Representation |
---|---|
bin | 11011010011110101010110… |
… | …100010001000010001100001 |
3 | 120202021102110012111220102120 |
4 | 123103311112202020101201 |
5 | 111220341203312020001 |
6 | 1103241511511134453 |
7 | 34204451012455623 |
oct | 3323652642102141 |
9 | 522242405456376 |
10 | 120110212220001 |
11 | 352a8500593353 |
12 | 1157a1b7074429 |
13 | 520346289c033 |
14 | 21935184d6c13 |
15 | dd45201bd236 |
hex | 6d3d56888461 |
120110212220001 has 4 divisors (see below), whose sum is σ = 160146949626672. Its totient is φ = 80073474813332.
The previous prime is 120110212219981. The next prime is 120110212220039. The reversal of 120110212220001 is 100022212011021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 120110212220001 - 214 = 120110212203617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120110212224001) 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, 20018368703331 + ... + 20018368703336.
It is an arithmetic number, because the mean of its divisors is an integer number (40036737406668).
Almost surely, 2120110212220001 is an apocalyptic number.
It is an amenable number.
120110212220001 is a deficient number, since it is larger than the sum of its proper divisors (40036737406671).
120110212220001 is an equidigital number, since it uses as much as digits as its factorization.
120110212220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40036737406670.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120110212220001 its reverse (100022212011021), we get a palindrome (220132424231022).
The spelling of 120110212220001 in words is "one hundred twenty trillion, one hundred ten billion, two hundred twelve million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •