Base | Representation |
---|---|
bin | 10110110000001000011000… |
… | …001010000100110101111001 |
3 | 111010022002002202211211010101 |
4 | 112300020120022010311321 |
5 | 101103424201124403130 |
6 | 552453004325115401 |
7 | 30035265625465252 |
oct | 2660103012046571 |
9 | 433262082754111 |
10 | 100064553356665 |
11 | 2997a158768517 |
12 | b281220558b61 |
13 | 43ab07c03bb01 |
14 | 1a9d2162ddb29 |
15 | b87d96b501ca |
hex | 5b0218284d79 |
100064553356665 has 12 divisors (see below), whose sum is σ = 124360845627564. Its totient is φ = 77291241210176.
The previous prime is 100064553356641. The next prime is 100064553356731. The reversal of 100064553356665 is 566653355460001.
It can be written as a sum of positive squares in 6 ways, for example, as 9967305666816 + 90097247689849 = 3157104^2 + 9491957^2 .
It is not a de Polignac number, because 100064553356665 - 211 = 100064553354617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11898278002 + ... + 11898286411.
It is an arithmetic number, because the mean of its divisors is an integer number (10363403802297).
Almost surely, 2100064553356665 is an apocalyptic number.
It is an amenable number.
100064553356665 is a deficient number, since it is larger than the sum of its proper divisors (24296292270899).
100064553356665 is an equidigital number, since it uses as much as digits as its factorization.
100064553356665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23796564476 (or 23796564447 counting only the distinct ones).
The product of its (nonzero) digits is 29160000, while the sum is 55.
The spelling of 100064553356665 in words is "one hundred trillion, sixty-four billion, five hundred fifty-three million, three hundred fifty-six thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •