Base | Representation |
---|---|
bin | 10001100110111010010… |
… | …101110110010111001001 |
3 | 11021200020211020111020111 |
4 | 101212322111312113021 |
5 | 124311101044200131 |
6 | 2323512154354321 |
7 | 153264141102043 |
oct | 21467225662711 |
9 | 4250224214214 |
10 | 1210012100041 |
11 | 427188316038 |
12 | 17661272b9a1 |
13 | 8a146950864 |
14 | 427ca11aa93 |
15 | 2171db88ab1 |
hex | 119ba5765c9 |
1210012100041 has 2 divisors, whose sum is σ = 1210012100042. Its totient is φ = 1210012100040.
The previous prime is 1210012100023. The next prime is 1210012100093. The reversal of 1210012100041 is 1400012100121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1116562055625 + 93450044416 = 1056675^2 + 305696^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210012100041 - 25 = 1210012100009 is a prime.
It is a super-3 number, since 3×12100121000413 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210012099994 and 1210012100030.
It is not a weakly prime, because it can be changed into another prime (1210012140041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605006050020 + 605006050021.
It is an arithmetic number, because the mean of its divisors is an integer number (605006050021).
Almost surely, 21210012100041 is an apocalyptic number.
It is an amenable number.
1210012100041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210012100041 is an equidigital number, since it uses as much as digits as its factorization.
1210012100041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1210012100041 its reverse (1400012100121), we get a palindrome (2610024200162).
The spelling of 1210012100041 in words is "one trillion, two hundred ten billion, twelve million, one hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •