Base | Representation |
---|---|
bin | 1010111011001100100110… |
… | …0111011110111010111111 |
3 | 1120112100100200022021021001 |
4 | 2232303021213132322333 |
5 | 3033301300422132203 |
6 | 41314142045351131 |
7 | 2346563211636214 |
oct | 256631147367277 |
9 | 46470320267231 |
10 | 12012111130303 |
11 | 391134263a2a9 |
12 | 142003b8684a7 |
13 | 69197789408b |
14 | 2d7564287b0b |
15 | 15c6e12e391d |
hex | aecc99deebf |
12012111130303 has 4 divisors (see below), whose sum is σ = 12032164738800. Its totient is φ = 11992057521808.
The previous prime is 12012111130231. The next prime is 12012111130321. The reversal of 12012111130303 is 30303111121021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12012111130303 - 29 = 12012111129791 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 (12012111130343) 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 3 ways as a sum of consecutive naturals, for example, 10026803350 + ... + 10026804547.
It is an arithmetic number, because the mean of its divisors is an integer number (3008041184700).
Almost surely, 212012111130303 is an apocalyptic number.
12012111130303 is a deficient number, since it is larger than the sum of its proper divisors (20053608497).
12012111130303 is an equidigital number, since it uses as much as digits as its factorization.
12012111130303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20053608496.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 12012111130303 its reverse (30303111121021), we get a palindrome (42315222251324).
The spelling of 12012111130303 in words is "twelve trillion, twelve billion, one hundred eleven million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •