Base | Representation |
---|---|
bin | 10010101000001101… |
… | …10101000100110100 |
3 | 221210222122222221200 |
4 | 21110012311010310 |
5 | 130440224322441 |
6 | 4332220212500 |
7 | 502556122314 |
oct | 112406650464 |
9 | 27728588850 |
10 | 10001010996 |
11 | 4272345649 |
12 | 1b3139a130 |
13 | c34c826b2 |
14 | 6ac347444 |
15 | 3d800c7b6 |
hex | 2541b5134 |
10001010996 has 72 divisors (see below), whose sum is σ = 25841821824. Its totient is φ = 3259758720.
The previous prime is 10001010989. The next prime is 10001010997. The reversal of 10001010996 is 69901010001.
It is a super-2 number, since 2×100010109962 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001010997) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2574976 + ... + 2578856.
It is an arithmetic number, because the mean of its divisors is an integer number (358914192).
Almost surely, 210001010996 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10001010996, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12920910912).
10001010996 is an abundant number, since it is smaller than the sum of its proper divisors (15840810828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001010996 is a wasteful number, since it uses less digits than its factorization.
10001010996 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5461 (or 5456 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
Adding to 10001010996 its reverse (69901010001), we get a palindrome (79902020997).
The spelling of 10001010996 in words is "ten billion, one million, ten thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •