Base | Representation |
---|---|
bin | 10010101001101011… |
… | …10000100010111100 |
3 | 221211211211000102022 |
4 | 21110311300202330 |
5 | 131001402010322 |
6 | 4333340015312 |
7 | 503065520660 |
oct | 112465604274 |
9 | 27754730368 |
10 | 10013313212 |
11 | 4279288471 |
12 | 1b35531538 |
13 | c3769c106 |
14 | 6adc2a8a0 |
15 | 3d913c942 |
hex | 254d708bc |
10013313212 has 96 divisors (see below), whose sum is σ = 21319925760. Its totient is φ = 4022504640.
The previous prime is 10013313209. The next prime is 10013313217. The reversal of 10013313212 is 21231331001.
It is a super-2 number, since 2×100133132122 (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 (10013313217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10311887 + ... + 10312857.
It is an arithmetic number, because the mean of its divisors is an integer number (222082560).
Almost surely, 210013313212 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 10013313212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10659962880).
10013313212 is an abundant number, since it is smaller than the sum of its proper divisors (11306612548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013313212 is a wasteful number, since it uses less digits than its factorization.
10013313212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1311 (or 1309 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10013313212 its reverse (21231331001), we get a palindrome (31244644213).
The spelling of 10013313212 in words is "ten billion, thirteen million, three hundred thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •