Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100011011110100000101 |
3 | 1022210121020222111120121221 |
4 | 2103020212210123310011 |
5 | 2311124312011200401 |
6 | 33300532422240341 |
7 | 2062332002543425 |
oct | 223104644336405 |
9 | 38717228446557 |
10 | 10111000100101 |
11 | 3249061a6613a |
12 | 11736b55860b1 |
13 | 5846038c9024 |
14 | 26d537088485 |
15 | 128024c3b7a1 |
hex | 9322691bd05 |
10111000100101 has 8 divisors (see below), whose sum is σ = 10207738430208. Its totient is φ = 10014558060000.
The previous prime is 10111000100059. The next prime is 10111000100167. The reversal of 10111000100101 is 10100100011101.
It is a happy number.
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 10111000100101 - 229 = 10110463229189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111000100401) 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 7 ways as a sum of consecutive naturals, for example, 74003925 + ... + 74140426.
It is an arithmetic number, because the mean of its divisors is an integer number (1275967303776).
Almost surely, 210111000100101 is an apocalyptic number.
It is an amenable number.
10111000100101 is a deficient number, since it is larger than the sum of its proper divisors (96738330107).
10111000100101 is a wasteful number, since it uses less digits than its factorization.
10111000100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148145003.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10111000100101 its reverse (10100100011101), we get a palindrome (20211100111202).
The spelling of 10111000100101 in words is "ten trillion, one hundred eleven billion, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •