Base | Representation |
---|---|
bin | 1010111011001100100011… |
… | …1101110101010110100011 |
3 | 1120112100022220202120100022 |
4 | 2232303020331311112203 |
5 | 3033301240123242011 |
6 | 41314141015344055 |
7 | 2346563020063625 |
oct | 256631075652643 |
9 | 46470286676308 |
10 | 12012100212131 |
11 | 3911337462318 |
12 | 142003808202b |
13 | 691975540616 |
14 | 2d7562a44c15 |
15 | 15c6e03888db |
hex | aecc8f755a3 |
12012100212131 has 8 divisors (see below), whose sum is σ = 12237740385024. Its totient is φ = 11787823424520.
The previous prime is 12012100212097. The next prime is 12012100212139. The reversal of 12012100212131 is 13121200121021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12012100212131 - 234 = 11994920342947 is a prime.
It is a super-2 number, since 2×120121002121312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12012100212139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 340828535 + ... + 340863776.
It is an arithmetic number, because the mean of its divisors is an integer number (1529717548128).
Almost surely, 212012100212131 is an apocalyptic number.
12012100212131 is a deficient number, since it is larger than the sum of its proper divisors (225640172893).
12012100212131 is an equidigital number, since it uses as much as digits as its factorization.
12012100212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681692641.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 12012100212131 its reverse (13121200121021), we get a palindrome (25133300333152).
The spelling of 12012100212131 in words is "twelve trillion, twelve billion, one hundred million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •