Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …0011101000110101001011 |
3 | 1022121022000102210012022001 |
4 | 2102110322303220311023 |
5 | 2304222133243230201 |
6 | 33215234003011431 |
7 | 2055325534464241 |
oct | 222247263506513 |
9 | 38538012705261 |
10 | 10055505055051 |
11 | 3227574503445 |
12 | 11649a8369b77 |
13 | 57c2cb58ba71 |
14 | 26a990a30791 |
15 | 126877c55301 |
hex | 9253ace8d4b |
10055505055051 has 2 divisors, whose sum is σ = 10055505055052. Its totient is φ = 10055505055050.
The previous prime is 10055505055049. The next prime is 10055505055111. The reversal of 10055505055051 is 15055050555001.
10055505055051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10055505055051 - 21 = 10055505055049 is a prime.
It is a super-2 number, since 2×100555050550512 (a number of 27 digits) contains 22 as substring.
Together with 10055505055049, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10055505055051.
It is not a weakly prime, because it can be changed into another prime (10055505055151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027752527525 + 5027752527526.
It is an arithmetic number, because the mean of its divisors is an integer number (5027752527526).
Almost surely, 210055505055051 is an apocalyptic number.
10055505055051 is a deficient number, since it is larger than the sum of its proper divisors (1).
10055505055051 is an equidigital number, since it uses as much as digits as its factorization.
10055505055051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78125, while the sum is 37.
The spelling of 10055505055051 in words is "ten trillion, fifty-five billion, five hundred five million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •