Base | Representation |
---|---|
bin | 10001100110111010001… |
… | …110100110110000100011 |
3 | 11021200020200200000102012 |
4 | 101212322032212300203 |
5 | 124311100102413443 |
6 | 2323512045543135 |
7 | 153264116002613 |
oct | 21467216466043 |
9 | 4250220600365 |
10 | 1210010201123 |
11 | 427187239389 |
12 | 176611b74aab |
13 | 8a146437439 |
14 | 427c9b84a43 |
15 | 2171d911118 |
hex | 119ba3a6c23 |
1210010201123 has 8 divisors (see below), whose sum is σ = 1249055763456. Its totient is φ = 1170965449800.
The previous prime is 1210010201069. The next prime is 1210010201131. The reversal of 1210010201123 is 3211020100121.
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 1210010201123 - 212 = 1210010197027 is a prime.
It is a super-2 number, since 2×12100102011232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210010201098 and 1210010201107.
It is not an unprimeable number, because it can be changed into a prime (1210010201423) 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, 4750418 + ... + 4998648.
It is an arithmetic number, because the mean of its divisors is an integer number (156131970432).
Almost surely, 21210010201123 is an apocalyptic number.
1210010201123 is a deficient number, since it is larger than the sum of its proper divisors (39045562333).
1210010201123 is a wasteful number, since it uses less digits than its factorization.
1210010201123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405505.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1210010201123 its reverse (3211020100121), we get a palindrome (4421030301244).
The spelling of 1210010201123 in words is "one trillion, two hundred ten billion, ten million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •