Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101101111100010100101 |
3 | 1022102002100122211001212201 |
4 | 2101202022231233202211 |
5 | 2302324032321041401 |
6 | 33134222344414501 |
7 | 2051356243556062 |
oct | 221421255574245 |
9 | 38362318731781 |
10 | 10001011112101 |
11 | 3206450057559 |
12 | 115631a477431 |
13 | 5771257864c9 |
14 | 2680a152dc69 |
15 | 125238abbb01 |
hex | 9188ab6f8a5 |
10001011112101 has 8 divisors (see below), whose sum is σ = 10131892353144. Its totient is φ = 9870754603200.
The previous prime is 10001011112021. The next prime is 10001011112167. The reversal of 10001011112101 is 10121111010001.
It can be written as a sum of positive squares in 4 ways, for example, as 3667987209601 + 6333023902500 = 1915199^2 + 2516550^2 .
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 10001011112101 - 229 = 10000474241189 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 (10001011112171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 156150810 + ... + 156214843.
It is an arithmetic number, because the mean of its divisors is an integer number (1266486544143).
Almost surely, 210001011112101 is an apocalyptic number.
It is an amenable number.
10001011112101 is a deficient number, since it is larger than the sum of its proper divisors (130881241043).
10001011112101 is a wasteful number, since it uses less digits than its factorization.
10001011112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312366071.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 10001011112101 its reverse (10121111010001), we get a palindrome (20122122122102).
The spelling of 10001011112101 in words is "ten trillion, one billion, eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •