Base | Representation |
---|---|
bin | 11101000110101101000… |
… | …11110000111010110110 |
3 | 10112121020221211220021212 |
4 | 32203112203300322312 |
5 | 112341031210043220 |
6 | 2043224114441422 |
7 | 132151504462640 |
oct | 16432643607266 |
9 | 3477227756255 |
10 | 1000032112310 |
11 | 3561250693a0 |
12 | 141990893272 |
13 | 733c1b300ca |
14 | 3658a805890 |
15 | 1b02e4ab0c5 |
hex | e8d68f0eb6 |
1000032112310 has 32 divisors (see below), whose sum is σ = 2244227910912. Its totient is φ = 311698320480.
The previous prime is 1000032112309. The next prime is 1000032112319. The reversal of 1000032112310 is 132112300001.
It is a super-2 number, since 2×10000321123102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000032112319) 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, 649370732 + ... + 649372271.
It is an arithmetic number, because the mean of its divisors is an integer number (70132122216).
Almost surely, 21000032112310 is an apocalyptic number.
1000032112310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000032112310 is an abundant number, since it is smaller than the sum of its proper divisors (1244195798602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000032112310 is a wasteful number, since it uses less digits than its factorization.
1000032112310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1298743028.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1000032112310 its reverse (132112300001), we get a palindrome (1132144412311).
The spelling of 1000032112310 in words is "one trillion, thirty-two million, one hundred twelve thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •