Base | Representation |
---|---|
bin | 1001001101110001110011… |
… | …0110111011000111001101 |
3 | 1022212122021020121211121010 |
4 | 2103130130312323013031 |
5 | 2312001433333324323 |
6 | 33314415254355433 |
7 | 2064015065030160 |
oct | 223343466730715 |
9 | 38778236554533 |
10 | 10132312011213 |
11 | 32570a8a88417 |
12 | 117786295bb79 |
13 | 58661c01c312 |
14 | 2705996b1ad7 |
15 | 128870c4bc93 |
hex | 9371cdbb1cd |
10132312011213 has 16 divisors (see below), whose sum is σ = 15444679775360. Its totient is φ = 5788030239936.
The previous prime is 10132312011169. The next prime is 10132312011223. The reversal of 10132312011213 is 31211021323101.
It is not a de Polignac number, because 10132312011213 - 210 = 10132312010189 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10132312011213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132312011223) 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, 77530570 + ... + 77661147.
It is an arithmetic number, because the mean of its divisors is an integer number (965292485960).
Almost surely, 210132312011213 is an apocalyptic number.
It is an amenable number.
10132312011213 is a deficient number, since it is larger than the sum of its proper divisors (5312367764147).
10132312011213 is a wasteful number, since it uses less digits than its factorization.
10132312011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155194836.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10132312011213 its reverse (31211021323101), we get a palindrome (41343333334314).
The spelling of 10132312011213 in words is "ten trillion, one hundred thirty-two billion, three hundred twelve million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •