Base | Representation |
---|---|
bin | 1010010001110000111011… |
… | …1110100010110010000111 |
3 | 1111000022002001100010121222 |
4 | 2210130032332202302013 |
5 | 2440121013404412244 |
6 | 40011142454030555 |
7 | 2244264136063022 |
oct | 244341676426207 |
9 | 44008061303558 |
10 | 11300310232199 |
11 | 366748658925a |
12 | 13260ab04845b |
13 | 63c7cb5c3bc1 |
14 | 2b0d1b9921b9 |
15 | 148e311e8bee |
hex | a470efa2c87 |
11300310232199 has 2 divisors, whose sum is σ = 11300310232200. Its totient is φ = 11300310232198.
The previous prime is 11300310232187. The next prime is 11300310232201. The reversal of 11300310232199 is 99123201300311.
11300310232199 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11300310232199 is a prime.
It is a super-2 number, since 2×113003102321992 (a number of 27 digits) contains 22 as substring.
Together with 11300310232201, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11300310232499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650155116099 + 5650155116100.
It is an arithmetic number, because the mean of its divisors is an integer number (5650155116100).
Almost surely, 211300310232199 is an apocalyptic number.
11300310232199 is a deficient number, since it is larger than the sum of its proper divisors (1).
11300310232199 is an equidigital number, since it uses as much as digits as its factorization.
11300310232199 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 35.
The spelling of 11300310232199 in words is "eleven trillion, three hundred billion, three hundred ten million, two hundred thirty-two thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •