Base | Representation |
---|---|
bin | 1001000111111001100111… |
… | …1011010111110000100100 |
3 | 1022111222121201020202100202 |
4 | 2101332121323113300210 |
5 | 2303323131231122040 |
6 | 33200155131330032 |
7 | 2053511510412116 |
oct | 221763173276044 |
9 | 38458551222322 |
10 | 10031331114020 |
11 | 3218299996787 |
12 | 11601805b0918 |
13 | 579c48230648 |
14 | 26973a2773b6 |
15 | 125e10856015 |
hex | 91f99ed7c24 |
10031331114020 has 24 divisors (see below), whose sum is σ = 21065960731200. Its totient is φ = 4012500942432.
The previous prime is 10031331114001. The next prime is 10031331114061. The reversal of 10031331114020 is 2041113313001.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10031331113983 and 10031331114001.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 732521 + ... + 4538639.
It is an arithmetic number, because the mean of its divisors is an integer number (877748363800).
Almost surely, 210031331114020 is an apocalyptic number.
10031331114020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10031331114020 is an abundant number, since it is smaller than the sum of its proper divisors (11034629617180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10031331114020 is a wasteful number, since it uses less digits than its factorization.
10031331114020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3937907 (or 3937905 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10031331114020 its reverse (2041113313001), we get a palindrome (12072444427021).
The spelling of 10031331114020 in words is "ten trillion, thirty-one billion, three hundred thirty-one million, one hundred fourteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •