Base | Representation |
---|---|
bin | 10000000100011000010… |
… | …110100010011000011011 |
3 | 10220120011122121220001221 |
4 | 100010120112202120123 |
5 | 121042413040000001 |
6 | 2203134110552511 |
7 | 142530323651554 |
oct | 20043026423033 |
9 | 3816148556057 |
10 | 1104215156251 |
11 | 39632773a2a9 |
12 | 15a007508737 |
13 | 8018615c77c |
14 | 3b63122732b |
15 | 1dacaa761a1 |
hex | 101185a261b |
1104215156251 has 2 divisors, whose sum is σ = 1104215156252. Its totient is φ = 1104215156250.
The previous prime is 1104215156203. The next prime is 1104215156279. The reversal of 1104215156251 is 1526515124011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1104215156251 - 227 = 1104080938523 is a prime.
It is a super-2 number, since 2×11042151562512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1104215150251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552107578125 + 552107578126.
It is an arithmetic number, because the mean of its divisors is an integer number (552107578126).
Almost surely, 21104215156251 is an apocalyptic number.
1104215156251 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104215156251 is an equidigital number, since it uses as much as digits as its factorization.
1104215156251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 34.
The spelling of 1104215156251 in words is "one trillion, one hundred four billion, two hundred fifteen million, one hundred fifty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •