Base | Representation |
---|---|
bin | 1001000111111001100101… |
… | …1101111110111110001000 |
3 | 1022111222121011202100212020 |
4 | 2101332121131332332020 |
5 | 2303323122243112222 |
6 | 33200154254244440 |
7 | 2053511355055251 |
oct | 221763135767610 |
9 | 38458534670766 |
10 | 10031323410312 |
11 | 3218295604886 |
12 | 1160179ab6720 |
13 | 579c46764039 |
14 | 26973922db28 |
15 | 125e0ed3365c |
hex | 91f9977ef88 |
10031323410312 has 64 divisors (see below), whose sum is σ = 25888555929600. Its totient is φ = 3235752064320.
The previous prime is 10031323410307. The next prime is 10031323410313. The reversal of 10031323410312 is 21301432313001.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (10031323410313) 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, 15347773 + ... + 15988019.
It is an arithmetic number, because the mean of its divisors is an integer number (404508686400).
Almost surely, 210031323410312 is an apocalyptic number.
10031323410312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10031323410312 is an abundant number, since it is smaller than the sum of its proper divisors (15857232519288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10031323410312 is a wasteful number, since it uses less digits than its factorization.
10031323410312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661346 (or 661342 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 10031323410312 its reverse (21301432313001), we get a palindrome (31332755723313).
The spelling of 10031323410312 in words is "ten trillion, thirty-one billion, three hundred twenty-three million, four hundred ten thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •