Base | Representation |
---|---|
bin | 101110100100101001… |
… | …0101110111001000101 |
3 | 100120011010210021221010 |
4 | 1131021102232321011 |
5 | 3114312024121422 |
6 | 113540140512433 |
7 | 10140303040254 |
oct | 1351122567105 |
9 | 316133707833 |
10 | 100013895237 |
11 | 39463266873 |
12 | 1747254b719 |
13 | 957b666289 |
14 | 4baac3a79b |
15 | 2905581b0c |
hex | 17494aee45 |
100013895237 has 16 divisors (see below), whose sum is σ = 140377878720. Its totient is φ = 63163296000.
The previous prime is 100013895209. The next prime is 100013895239. The reversal of 100013895237 is 732598310001.
It is not a de Polignac number, because 100013895237 - 234 = 82834026053 is a prime.
It is a super-2 number, since 2×1000138952372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100013895195 and 100013895204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013895239) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1438987 + ... + 1506887.
It is an arithmetic number, because the mean of its divisors is an integer number (8773617420).
Almost surely, 2100013895237 is an apocalyptic number.
It is an amenable number.
100013895237 is a deficient number, since it is larger than the sum of its proper divisors (40363983483).
100013895237 is a wasteful number, since it uses less digits than its factorization.
100013895237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93764.
The product of its (nonzero) digits is 45360, while the sum is 39.
The spelling of 100013895237 in words is "one hundred billion, thirteen million, eight hundred ninety-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •