Base | Representation |
---|---|
bin | 10110110111010000100101… |
… | …111011010111110101001111 |
3 | 111012000220111202202220102201 |
4 | 112313100211323113311033 |
5 | 101134440413111430210 |
6 | 553510020351102331 |
7 | 30115550015021200 |
oct | 2667204573276517 |
9 | 435026452686381 |
10 | 100554410655055 |
11 | 2a048982404095 |
12 | b3401508119a7 |
13 | 4415317a574a6 |
14 | 1ab8c064555a7 |
15 | b959b70d853a |
hex | 5b7425ed7d4f |
100554410655055 has 24 divisors (see below), whose sum is σ = 141812818359408. Its totient is φ = 68240754667008.
The previous prime is 100554410655029. The next prime is 100554410655089. The reversal of 100554410655055 is 550556014455001.
It is not a de Polignac number, because 100554410655055 - 29 = 100554410654543 is a prime.
It is a super-2 number, since 2×1005544106550552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100554410654996 and 100554410655014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2115575029 + ... + 2115622558.
It is an arithmetic number, because the mean of its divisors is an integer number (5908867431642).
Almost surely, 2100554410655055 is an apocalyptic number.
100554410655055 is a deficient number, since it is larger than the sum of its proper divisors (41258407704353).
100554410655055 is an equidigital number, since it uses as much as digits as its factorization.
100554410655055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4231197703 (or 4231197696 counting only the distinct ones).
The product of its (nonzero) digits is 1500000, while the sum is 46.
The spelling of 100554410655055 in words is "one hundred trillion, five hundred fifty-four billion, four hundred ten million, six hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •