Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0100011000101110111001 |
3 | 1022202112220010121000022221 |
4 | 2102332113210120232321 |
5 | 2310434310304323001 |
6 | 33251514144044041 |
7 | 2061462455042662 |
oct | 222762744305671 |
9 | 38675803530287 |
10 | 10100011011001 |
11 | 32444329aa91a |
12 | 1171549303621 |
13 | 583572021a42 |
14 | 26cbb3818369 |
15 | 127ad01051a1 |
hex | 92f97918bb9 |
10100011011001 has 8 divisors (see below), whose sum is σ = 10110501712584. Its totient is φ = 10089525588480.
The previous prime is 10100011010977. The next prime is 10100011011031. The reversal of 10100011011001 is 10011011000101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 86583651001 + 10013427360000 = 294251^2 + 3164400^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 10100011011001 - 221 = 10100008913849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10100011011031) 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, 2514441 + ... + 5149993.
It is an arithmetic number, because the mean of its divisors is an integer number (1263812714073).
Almost surely, 210100011011001 is an apocalyptic number.
It is an amenable number.
10100011011001 is a deficient number, since it is larger than the sum of its proper divisors (10490701583).
10100011011001 is a wasteful number, since it uses less digits than its factorization.
10100011011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2639531.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10100011011001 its reverse (10011011000101), we get a palindrome (20111022011102).
The spelling of 10100011011001 in words is "ten trillion, one hundred billion, eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •