Base | Representation |
---|---|
bin | 10010101011110100… |
… | …11011000011010000 |
3 | 221220002200111121222 |
4 | 21111322123003100 |
5 | 131021004004404 |
6 | 4335221504212 |
7 | 503404516541 |
oct | 112572330320 |
9 | 27802614558 |
10 | 10031313104 |
11 | 428846200a |
12 | 1b3b572068 |
13 | c3b332037 |
14 | 6b23944c8 |
15 | 3da9e5dbe |
hex | 255e9b0d0 |
10031313104 has 80 divisors (see below), whose sum is σ = 20910268800. Its totient is φ = 4650928128.
The previous prime is 10031313091. The next prime is 10031313107. The reversal of 10031313104 is 40131313001.
It is a super-2 number, since 2×100313131042 (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 (10031313107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1581812 + ... + 1588140.
It is an arithmetic number, because the mean of its divisors is an integer number (261378360).
Almost surely, 210031313104 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 10031313104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10455134400).
10031313104 is an abundant number, since it is smaller than the sum of its proper divisors (10878955696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10031313104 is a wasteful number, since it uses less digits than its factorization.
10031313104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6492 (or 6486 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10031313104 its reverse (40131313001), we get a palindrome (50162626105).
The spelling of 10031313104 in words is "ten billion, thirty-one million, three hundred thirteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •