Base | Representation |
---|---|
bin | 1001001100100110010000… |
… | …0010010001011110000110 |
3 | 1022210200220211221121011111 |
4 | 2103021210002101132012 |
5 | 2311133420010112410 |
6 | 33301223021155234 |
7 | 2062366364064202 |
oct | 223114402213606 |
9 | 38720824847144 |
10 | 10112031332230 |
11 | 32495410810a3 |
12 | 11739429bbb1a |
13 | 58473944cc59 |
14 | 26d5d4005b02 |
15 | 12808553bb8a |
hex | 93264091786 |
10112031332230 has 8 divisors (see below), whose sum is σ = 18201656398032. Its totient is φ = 4044812532888.
The previous prime is 10112031332191. The next prime is 10112031332231. The reversal of 10112031332230 is 3223313021101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112031332231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505601566602 + ... + 505601566621.
It is an arithmetic number, because the mean of its divisors is an integer number (2275207049754).
Almost surely, 210112031332230 is an apocalyptic number.
10112031332230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10112031332230 is a deficient number, since it is larger than the sum of its proper divisors (8089625065802).
10112031332230 is a wasteful number, since it uses less digits than its factorization.
10112031332230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011203133230.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10112031332230 its reverse (3223313021101), we get a palindrome (13335344353331).
The spelling of 10112031332230 in words is "ten trillion, one hundred twelve billion, thirty-one million, three hundred thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •