Base | Representation |
---|---|
bin | 101110100100101001… |
… | …1100101110001000001 |
3 | 100120011011012201020201 |
4 | 1131021103211301001 |
5 | 3114312103320001 |
6 | 113540145405201 |
7 | 10140304664455 |
oct | 1351123456101 |
9 | 316134181221 |
10 | 100014120001 |
11 | 394633aa724 |
12 | 17472639801 |
13 | 957b714683 |
14 | 4baac98665 |
15 | 29055c8501 |
hex | 17494e5c41 |
100014120001 has 16 divisors (see below), whose sum is σ = 102220243200. Its totient is φ = 97834359168.
The previous prime is 100014119983. The next prime is 100014120013. The reversal of 100014120001 is 100021410001.
It is a cyclic number.
It is not a de Polignac number, because 100014120001 - 27 = 100014119873 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100014120001.
It is not an unprimeable number, because it can be changed into a prime (100014120601) 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 15 ways as a sum of consecutive naturals, for example, 5651595 + ... + 5669263.
It is an arithmetic number, because the mean of its divisors is an integer number (6388765200).
Almost surely, 2100014120001 is an apocalyptic number.
It is an amenable number.
100014120001 is a deficient number, since it is larger than the sum of its proper divisors (2206123199).
100014120001 is a wasteful number, since it uses less digits than its factorization.
100014120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18408.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100014120001 its reverse (100021410001), we get a palindrome (200035530002).
Subtracting 100014120001 from its reverse (100021410001), we obtain a square (7290000 = 27002).
The spelling of 100014120001 in words is "one hundred billion, fourteen million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •