Base | Representation |
---|---|
bin | 10010101011110100… |
… | …11010010010111100 |
3 | 221220002200100101110 |
4 | 21111322122102330 |
5 | 131021003410022 |
6 | 4335221442020 |
7 | 503404504533 |
oct | 112572322274 |
9 | 27802610343 |
10 | 10031310012 |
11 | 428845a759 |
12 | 1b3b570310 |
13 | c3b3307c9 |
14 | 6b239331a |
15 | 3da9e500c |
hex | 255e9a4bc |
10031310012 has 12 divisors (see below), whose sum is σ = 23406390056. Its totient is φ = 3343770000.
The previous prime is 10031309927. The next prime is 10031310073. The reversal of 10031310012 is 21001313001.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 835942501 = 10031310012 / (1 + 0 + 0 + 3 + 1 + 3 + 1 + 0 + 0 + 1 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 10031310012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417971239 + ... + 417971262.
Almost surely, 210031310012 is an apocalyptic number.
10031310012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10031310012 is an abundant number, since it is smaller than the sum of its proper divisors (13375080044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10031310012 is a wasteful number, since it uses less digits than its factorization.
10031310012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835942508 (or 835942506 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10031310012 its reverse (21001313001), we get a palindrome (31032623013).
The spelling of 10031310012 in words is "ten billion, thirty-one million, three hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •