Base | Representation |
---|---|
bin | 10111011110001110010011… |
… | …011010101100111101011011 |
3 | 111112111212212102111020211001 |
4 | 113132032103122230331123 |
5 | 102012323130111210021 |
6 | 1003320044241045431 |
7 | 30513160332506566 |
oct | 2736162332547533 |
9 | 445455772436731 |
10 | 103232012210011 |
11 | 2a9904a5704263 |
12 | b6b3080026877 |
13 | 457a9771babc9 |
14 | 1b6c65558b4dd |
15 | be047ca87091 |
hex | 5de3936acf5b |
103232012210011 has 8 divisors (see below), whose sum is σ = 107720923878144. Its totient is φ = 98743147484520.
The previous prime is 103232012210003. The next prime is 103232012210111. The reversal of 103232012210011 is 110012210232301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103232012210011 - 23 = 103232012210003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103232012210111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7204591 + ... + 16073896.
It is an arithmetic number, because the mean of its divisors is an integer number (13465115484768).
Almost surely, 2103232012210011 is an apocalyptic number.
103232012210011 is a deficient number, since it is larger than the sum of its proper divisors (4488911668133).
103232012210011 is a wasteful number, since it uses less digits than its factorization.
103232012210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23471321.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103232012210011 its reverse (110012210232301), we get a palindrome (213244222442312).
The spelling of 103232012210011 in words is "one hundred three trillion, two hundred thirty-two billion, twelve million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •