Base | Representation |
---|---|
bin | 1001001101101101110010… |
… | …0010111010010011101010 |
3 | 1022212112111001022120022111 |
4 | 2103123130202322103222 |
5 | 2311442231123220320 |
6 | 33314120232112534 |
7 | 2063646253546435 |
oct | 223333442722352 |
9 | 38775431276274 |
10 | 10131233023210 |
11 | 32566a4a147a2 |
12 | 117760153574a |
13 | 5864a9617590 |
14 | 2704d628281c |
15 | 12880b166a5a |
hex | 936dc8ba4ea |
10131233023210 has 128 divisors (see below), whose sum is σ = 20320908410880. Its totient is φ = 3613019095296.
The previous prime is 10131233023183. The next prime is 10131233023237. The reversal of 10131233023210 is 1232033213101.
It is an interprime number because it is at equal distance from previous prime (10131233023183) and next prime (10131233023237).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1295053359 + ... + 1295061181.
It is an arithmetic number, because the mean of its divisors is an integer number (158757096960).
Almost surely, 210131233023210 is an apocalyptic number.
10131233023210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131233023210 is an abundant number, since it is smaller than the sum of its proper divisors (10189675387670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131233023210 is a wasteful number, since it uses less digits than its factorization.
10131233023210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10652.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10131233023210 its reverse (1232033213101), we get a palindrome (11363266236311).
The spelling of 10131233023210 in words is "ten trillion, one hundred thirty-one billion, two hundred thirty-three million, twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •