Base | Representation |
---|---|
bin | 1001000111111100010001… |
… | …0000100101111010101111 |
3 | 1022112001110012121221222001 |
4 | 2101333010100211322233 |
5 | 2303331110034220421 |
6 | 33200353421433131 |
7 | 2053535223151606 |
oct | 221770420457257 |
9 | 38461405557861 |
10 | 10032041320111 |
11 | 3218623877068 |
12 | 116033a40b7a7 |
13 | 57a02c404335 |
14 | 2697a670aa3d |
15 | 125e52d92691 |
hex | 91fc4425eaf |
10032041320111 has 4 divisors (see below), whose sum is σ = 10045994090400. Its totient is φ = 10018088549824.
The previous prime is 10032041320097. The next prime is 10032041320141. The reversal of 10032041320111 is 11102314023001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10032041320111 - 27 = 10032041319983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10032041320141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6976384066 + ... + 6976385503.
It is an arithmetic number, because the mean of its divisors is an integer number (2511498522600).
Almost surely, 210032041320111 is an apocalyptic number.
10032041320111 is a deficient number, since it is larger than the sum of its proper divisors (13952770289).
10032041320111 is an equidigital number, since it uses as much as digits as its factorization.
10032041320111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13952770288.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10032041320111 its reverse (11102314023001), we get a palindrome (21134355343112).
The spelling of 10032041320111 in words is "ten trillion, thirty-two billion, forty-one million, three hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •