Base | Representation |
---|---|
bin | 1011001011111101000111… |
… | …0011100001001111100101 |
3 | 1121112212110221021211211021 |
4 | 2302333101303201033211 |
5 | 3103010410343441401 |
6 | 42054314105411141 |
7 | 2406434514050632 |
oct | 262772163411745 |
9 | 47485427254737 |
10 | 12300011312101 |
11 | 3a124507a8047 |
12 | 14679a8a99ab1 |
13 | 6b2b6997c336 |
14 | 307476427189 |
15 | 164e415b62a1 |
hex | b2fd1ce13e5 |
12300011312101 has 4 divisors (see below), whose sum is σ = 12300057309600. Its totient is φ = 12299965314604.
The previous prime is 12300011312081. The next prime is 12300011312153. The reversal of 12300011312101 is 10121311000321.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12300011312101 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 (12300011310101) 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, 22595281 + ... + 23133238.
It is an arithmetic number, because the mean of its divisors is an integer number (3075014327400).
Almost surely, 212300011312101 is an apocalyptic number.
It is an amenable number.
12300011312101 is a deficient number, since it is larger than the sum of its proper divisors (45997499).
12300011312101 is an equidigital number, since it uses as much as digits as its factorization.
12300011312101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45997498.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12300011312101 its reverse (10121311000321), we get a palindrome (22421322312422).
The spelling of 12300011312101 in words is "twelve trillion, three hundred billion, eleven million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •