Base | Representation |
---|---|
bin | 1001001101110000101011… |
… | …1111100111101100110111 |
3 | 1022212121111100122222121222 |
4 | 2103130022333213230313 |
5 | 2312000330122113421 |
6 | 33314325430500555 |
7 | 2064004465365611 |
oct | 223341277475467 |
9 | 38777440588558 |
10 | 10132012301111 |
11 | 3256a64891818 |
12 | 117779a50475b |
13 | 5865a1bc346c |
14 | 27056b975db1 |
15 | 128854798cab |
hex | 9370afe7b37 |
10132012301111 has 4 divisors (see below), whose sum is σ = 10236466036272. Its totient is φ = 10027558565952.
The previous prime is 10132012301041. The next prime is 10132012301141. The reversal of 10132012301111 is 11110321023101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132012301111 is a prime.
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 10132012301111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132012301141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52226867435 + ... + 52226867628.
It is an arithmetic number, because the mean of its divisors is an integer number (2559116509068).
Almost surely, 210132012301111 is an apocalyptic number.
10132012301111 is a deficient number, since it is larger than the sum of its proper divisors (104453735161).
10132012301111 is an equidigital number, since it uses as much as digits as its factorization.
10132012301111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104453735160.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10132012301111 its reverse (11110321023101), we get a palindrome (21242333324212).
The spelling of 10132012301111 in words is "ten trillion, one hundred thirty-two billion, twelve million, three hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •