Base | Representation |
---|---|
bin | 1011001011111101111001… |
… | …1011100011010110110111 |
3 | 1121112220000200212110121212 |
4 | 2302333132123203112313 |
5 | 3103011324110224421 |
6 | 42054351113432035 |
7 | 2406442665360614 |
oct | 262773633432667 |
9 | 47486020773555 |
10 | 12300223133111 |
11 | 3a1254a324331 |
12 | 1467a47a0b61b |
13 | 6b2ba1815004 |
14 | 30749660550b |
15 | 164e54ea7e5b |
hex | b2fde6e35b7 |
12300223133111 has 8 divisors (see below), whose sum is σ = 12620197268448. Its totient is φ = 11981199888000.
The previous prime is 12300223133101. The next prime is 12300223133113. The reversal of 12300223133111 is 11133132200321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12300223133111 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 (12300223133113) 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, 237696350 + ... + 237748091.
It is an arithmetic number, because the mean of its divisors is an integer number (1577524658556).
Almost surely, 212300223133111 is an apocalyptic number.
12300223133111 is a deficient number, since it is larger than the sum of its proper divisors (319974135337).
12300223133111 is an equidigital number, since it uses as much as digits as its factorization.
12300223133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475445113.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12300223133111 its reverse (11133132200321), we get a palindrome (23433355333432).
The spelling of 12300223133111 in words is "twelve trillion, three hundred billion, two hundred twenty-three million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •