Base | Representation |
---|---|
bin | 10111101100100011100100… |
… | …011110010001101111101101 |
3 | 111200000001002022112021120021 |
4 | 113230203210132101233231 |
5 | 102124442222410044042 |
6 | 1005352331504522141 |
7 | 30644265264344404 |
oct | 2754434436215755 |
9 | 450001068467507 |
10 | 104216919612397 |
11 | 30230169212189 |
12 | b831b2b620351 |
13 | 461c7c86b92c7 |
14 | 1ba41a938863b |
15 | c0adc42e7867 |
hex | 5ec8e4791bed |
104216919612397 has 2 divisors, whose sum is σ = 104216919612398. Its totient is φ = 104216919612396.
The previous prime is 104216919612383. The next prime is 104216919612401. The reversal of 104216919612397 is 793216919612401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100102306152996 + 4114613459401 = 10005114^2 + 2028451^2 .
It is a cyclic number.
It is not a de Polignac number, because 104216919612397 - 27 = 104216919612269 is a prime.
It is a super-2 number, since 2×1042169196123972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104216919642397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52108459806198 + 52108459806199.
It is an arithmetic number, because the mean of its divisors is an integer number (52108459806199).
Almost surely, 2104216919612397 is an apocalyptic number.
It is an amenable number.
104216919612397 is a deficient number, since it is larger than the sum of its proper divisors (1).
104216919612397 is an equidigital number, since it uses as much as digits as its factorization.
104216919612397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8817984, while the sum is 61.
The spelling of 104216919612397 in words is "one hundred four trillion, two hundred sixteen billion, nine hundred nineteen million, six hundred twelve thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •