Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1110010111010011011001 |
3 | 1022102000000020111020001021 |
4 | 2101201110132113103121 |
5 | 2302320201341023001 |
6 | 33133552200122441 |
7 | 2051324553644461 |
oct | 221412436272331 |
9 | 38360006436037 |
10 | 10000101111001 |
11 | 3206023414231 |
12 | 1156105766421 |
13 | 57700c09a911 |
14 | 26801672cba1 |
15 | 1251d3c66ba1 |
hex | 918547974d9 |
10000101111001 has 4 divisors (see below), whose sum is σ = 10000108623312. Its totient is φ = 10000093598692.
The previous prime is 10000101110977. The next prime is 10000101111031. The reversal of 10000101111001 is 10011110100001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10000101111001 - 217 = 10000100979929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000101111031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1162375 + ... + 4620748.
It is an arithmetic number, because the mean of its divisors is an integer number (2500027155828).
Almost surely, 210000101111001 is an apocalyptic number.
It is an amenable number.
10000101111001 is a deficient number, since it is larger than the sum of its proper divisors (7512311).
10000101111001 is an equidigital number, since it uses as much as digits as its factorization.
10000101111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7512310.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10000101111001 its reverse (10011110100001), we get a palindrome (20011211211002).
The spelling of 10000101111001 in words is "ten trillion, one hundred one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •