Base | Representation |
---|---|
bin | 1001001001010100000011… |
… | …0000010100100011011001 |
3 | 1022121022021101120020122221 |
4 | 2102111000300110203121 |
5 | 2304222334320130412 |
6 | 33215251525544041 |
7 | 2055331155640261 |
oct | 222250060244331 |
9 | 38538241506587 |
10 | 10055604848857 |
11 | 3227615873a67 |
12 | 1164a15875021 |
13 | 57c31615c759 |
14 | 26a99ddaa7a1 |
15 | 1268818b8b07 |
hex | 92540c148d9 |
10055604848857 has 2 divisors, whose sum is σ = 10055604848858. Its totient is φ = 10055604848856.
The previous prime is 10055604848803. The next prime is 10055604848893. The reversal of 10055604848857 is 75884840655001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8911156344336 + 1144448504521 = 2985156^2 + 1069789^2 .
It is a cyclic number.
It is not a de Polignac number, because 10055604848857 - 219 = 10055604324569 is a prime.
It is a super-2 number, since 2×100556048488572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10055604848795 and 10055604848804.
It is not a weakly prime, because it can be changed into another prime (10055604848057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027802424428 + 5027802424429.
It is an arithmetic number, because the mean of its divisors is an integer number (5027802424429).
Almost surely, 210055604848857 is an apocalyptic number.
It is an amenable number.
10055604848857 is a deficient number, since it is larger than the sum of its proper divisors (1).
10055604848857 is an equidigital number, since it uses as much as digits as its factorization.
10055604848857 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43008000, while the sum is 61.
The spelling of 10055604848857 in words is "ten trillion, fifty-five billion, six hundred four million, eight hundred forty-eight thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •