Base | Representation |
---|---|
bin | 101110100100100100… |
… | …0000110111001111101 |
3 | 100120010221112210022200 |
4 | 1131021020012321331 |
5 | 3114310321010023 |
6 | 113540001102113 |
7 | 10140240260133 |
oct | 1351110067175 |
9 | 316127483280 |
10 | 100011110013 |
11 | 39461734231 |
12 | 17471627939 |
13 | 957abcc609 |
14 | 4baa713753 |
15 | 29051d1743 |
hex | 1749206e7d |
100011110013 has 12 divisors (see below), whose sum is σ = 150741383520. Its totient is φ = 63775200456.
The previous prime is 100011109999. The next prime is 100011110021. The reversal of 100011110013 is 310011110001.
It is not a de Polignac number, because 100011110013 - 26 = 100011109949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100011109977 and 100011110004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100011110033) 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 11 ways as a sum of consecutive naturals, for example, 241572523 + ... + 241572936.
It is an arithmetic number, because the mean of its divisors is an integer number (12561781960).
Almost surely, 2100011110013 is an apocalyptic number.
It is an amenable number.
100011110013 is a deficient number, since it is larger than the sum of its proper divisors (50730273507).
100011110013 is a wasteful number, since it uses less digits than its factorization.
100011110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483145488 (or 483145485 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 100011110013 its reverse (310011110001), we get a palindrome (410022220014).
The spelling of 100011110013 in words is "one hundred billion, eleven million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •