Base | Representation |
---|---|
bin | 1001010011100101100011… |
… | …0000110110101101110111 |
3 | 1100020011211201202222220222 |
4 | 2110321120300312231313 |
5 | 2320120320413113421 |
6 | 33432321253244555 |
7 | 2104150003013414 |
oct | 224713060665567 |
9 | 40204751688828 |
10 | 10232101301111 |
11 | 3295456485938 |
12 | 119307203375b |
13 | 592b62c94911 |
14 | 27534476310b |
15 | 12b261713cab |
hex | 94e58c36b77 |
10232101301111 has 4 divisors (see below), whose sum is σ = 10238390240232. Its totient is φ = 10225812361992.
The previous prime is 10232101301077. The next prime is 10232101301119. The reversal of 10232101301111 is 11110310123201.
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-10232101301111 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 10232101301111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232101301119) 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, 3144467120 + ... + 3144470373.
It is an arithmetic number, because the mean of its divisors is an integer number (2559597560058).
Almost surely, 210232101301111 is an apocalyptic number.
10232101301111 is a deficient number, since it is larger than the sum of its proper divisors (6288939121).
10232101301111 is an equidigital number, since it uses as much as digits as its factorization.
10232101301111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6288939120.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10232101301111 its reverse (11110310123201), we get a palindrome (21342411424312).
The spelling of 10232101301111 in words is "ten trillion, two hundred thirty-two billion, one hundred one million, three hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •