Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0011101111000010100001 |
3 | 1022102002022220002121010011 |
4 | 2101202022003233002201 |
5 | 2302324022011200001 |
6 | 33134221312404521 |
7 | 2051356051142611 |
oct | 221421203570241 |
9 | 38362286077104 |
10 | 10001000100001 |
11 | 3206444915a49 |
12 | 1156316846741 |
13 | 5771233cc081 |
14 | 26809dca4a41 |
15 | 125237b43d51 |
hex | 9188a0ef0a1 |
10001000100001 has 8 divisors (see below), whose sum is σ = 10048147946784. Its totient is φ = 9953879364000.
The previous prime is 10001000099843. The next prime is 10001000100011. The reversal of 10001000100001 is 10000100010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10001000100001 - 231 = 9998852616353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10001000100011) 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 7 ways as a sum of consecutive naturals, for example, 6037980 + ... + 7513933.
It is an arithmetic number, because the mean of its divisors is an integer number (1256018493348).
Almost surely, 210001000100001 is an apocalyptic number.
It is an amenable number.
10001000100001 is a deficient number, since it is larger than the sum of its proper divisors (47147846783).
10001000100001 is a wasteful number, since it uses less digits than its factorization.
10001000100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13555391.
The product of its (nonzero) digits is 1, while the sum is 4.
Adding to 10001000100001 its reverse (10000100010001), we get a palindrome (20001100110002).
It can be divided in two parts, 1000100010000 and 1, that added together give a palindrome (1000100010001).
The spelling of 10001000100001 in words is "ten trillion, one billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •