Base | Representation |
---|---|
bin | 10110110111010001001100… |
… | …000100001101010101001111 |
3 | 111012000222011100202200022020 |
4 | 112313101030010031111033 |
5 | 101134443220412134201 |
6 | 553510204045221223 |
7 | 30115601614453425 |
oct | 2667211404152517 |
9 | 435028140680266 |
10 | 100555050505551 |
11 | 2a049180600254 |
12 | b3402aab61813 |
13 | 44153ba496855 |
14 | 1ab8c67413115 |
15 | b95a03378a36 |
hex | 5b744c10d54f |
100555050505551 has 8 divisors (see below), whose sum is σ = 135688742851200. Its totient is φ = 66229029248472.
The previous prime is 100555050505537. The next prime is 100555050505577. The reversal of 100555050505551 is 155505050555001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100555050505551 - 218 = 100555050243407 is a prime.
It is a super-2 number, since 2×1005550505055512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100555050505451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201917771851 + ... + 201917772348.
It is an arithmetic number, because the mean of its divisors is an integer number (16961092856400).
Almost surely, 2100555050505551 is an apocalyptic number.
100555050505551 is a deficient number, since it is larger than the sum of its proper divisors (35133692345649).
100555050505551 is an equidigital number, since it uses as much as digits as its factorization.
100555050505551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403835544285.
The product of its (nonzero) digits is 390625, while the sum is 42.
The spelling of 100555050505551 in words is "one hundred trillion, five hundred fifty-five billion, fifty million, five hundred five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •