Base | Representation |
---|---|
bin | 101110110011101000… |
… | …0110010001110000001 |
3 | 100121110011220110211220 |
4 | 1131213100302032001 |
5 | 3121324233413212 |
6 | 114102101425253 |
7 | 10155616601403 |
oct | 1354720621601 |
9 | 317404813756 |
10 | 100516701057 |
11 | 396a106a273 |
12 | 17592a0b229 |
13 | 962b891506 |
14 | 4c17922b73 |
15 | 29347a138c |
hex | 1767432381 |
100516701057 has 32 divisors (see below), whose sum is σ = 145251532800. Its totient is φ = 61583289600.
The previous prime is 100516701013. The next prime is 100516701071. The reversal of 100516701057 is 750107615001.
It is not a de Polignac number, because 100516701057 - 211 = 100516699009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100516701097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10519432 + ... + 10528982.
It is an arithmetic number, because the mean of its divisors is an integer number (4539110400).
Almost surely, 2100516701057 is an apocalyptic number.
100516701057 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
100516701057 is a deficient number, since it is larger than the sum of its proper divisors (44734831743).
100516701057 is a wasteful number, since it uses less digits than its factorization.
100516701057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14413.
The product of its (nonzero) digits is 7350, while the sum is 33.
The spelling of 100516701057 in words is "one hundred billion, five hundred sixteen million, seven hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •