Base | Representation |
---|---|
bin | 101110110011100001… |
… | …1110110110110011011 |
3 | 100121102221112022011000 |
4 | 1131213003312312123 |
5 | 3121322401442110 |
6 | 114101501040043 |
7 | 10155546025254 |
oct | 1354703666633 |
9 | 317387468130 |
10 | 100513312155 |
11 | 3969a165123 |
12 | 17591856023 |
13 | 962ac75b49 |
14 | 4c172bdb2b |
15 | 29343321c0 |
hex | 17670f6d9b |
100513312155 has 16 divisors (see below), whose sum is σ = 178690332960. Its totient is φ = 53607099744.
The previous prime is 100513312129. The next prime is 100513312169. The reversal of 100513312155 is 551213315001.
100513312155 is a `hidden beast` number, since 100 + 513 + 31 + 2 + 15 + 5 = 666.
It is not a de Polignac number, because 100513312155 - 27 = 100513312027 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 372271392 + ... + 372271661.
It is an arithmetic number, because the mean of its divisors is an integer number (11168145810).
Almost surely, 2100513312155 is an apocalyptic number.
100513312155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
100513312155 is a deficient number, since it is larger than the sum of its proper divisors (78177020805).
100513312155 is an equidigital number, since it uses as much as digits as its factorization.
100513312155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744543067 (or 744543061 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
Adding to 100513312155 its reverse (551213315001), we get a palindrome (651726627156).
The spelling of 100513312155 in words is "one hundred billion, five hundred thirteen million, three hundred twelve thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •