Base | Representation |
---|---|
bin | 101110110000101001… |
… | …0111110111010001111 |
3 | 100121012012120112021000 |
4 | 1131201102332322033 |
5 | 3121123123122111 |
6 | 114044124311343 |
7 | 10153263064446 |
oct | 1354122767217 |
9 | 317165515230 |
10 | 100416614031 |
11 | 3964a619418 |
12 | 175653a2553 |
13 | 9613c1a216 |
14 | 4c0850bd5d |
15 | 292aad0c56 |
hex | 17614bee8f |
100416614031 has 32 divisors (see below), whose sum is σ = 159249312000. Its totient is φ = 62346068064.
The previous prime is 100416614029. The next prime is 100416614059. The reversal of 100416614031 is 130416614001.
100416614031 is a `hidden beast` number, since 1 + 0 + 0 + 4 + 16 + 614 + 0 + 31 = 666.
It is not a de Polignac number, because 100416614031 - 21 = 100416614029 is a prime.
It is a super-2 number, since 2×1004166140312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 100416613986 and 100416614004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100416614021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1628580 + ... + 1689113.
It is an arithmetic number, because the mean of its divisors is an integer number (4976541000).
Almost surely, 2100416614031 is an apocalyptic number.
100416614031 is a deficient number, since it is larger than the sum of its proper divisors (58832697969).
100416614031 is a wasteful number, since it uses less digits than its factorization.
100416614031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3317780 (or 3317774 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 100416614031 in words is "one hundred billion, four hundred sixteen million, six hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •