Base | Representation |
---|---|
bin | 1001001101101101110001… |
… | …1111110001101000001110 |
3 | 1022212112110222202210202210 |
4 | 2103123130133301220032 |
5 | 2311442230420414410 |
6 | 33314120202331250 |
7 | 2063646243554130 |
oct | 223333437615016 |
9 | 38775428683683 |
10 | 10131232201230 |
11 | 32566a4503178 |
12 | 11776011b9b26 |
13 | 5864a93ba3ba |
14 | 2704d610b050 |
15 | 12880b053220 |
hex | 936dc7f1a0e |
10131232201230 has 64 divisors (see below), whose sum is σ = 27934012366848. Its totient is φ = 2303586071040.
The previous prime is 10131232201219. The next prime is 10131232201243. The reversal of 10131232201230 is 3210223213101.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 10131232201197 and 10131232201206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 126252987 + ... + 126333206.
It is an arithmetic number, because the mean of its divisors is an integer number (436468943232).
Almost surely, 210131232201230 is an apocalyptic number.
10131232201230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131232201230 is an abundant number, since it is smaller than the sum of its proper divisors (17802780165618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131232201230 is a wasteful number, since it uses less digits than its factorization.
10131232201230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 252586401.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10131232201230 its reverse (3210223213101), we get a palindrome (13341455414331).
The spelling of 10131232201230 in words is "ten trillion, one hundred thirty-one billion, two hundred thirty-two million, two hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •