Base | Representation |
---|---|
bin | 1011000001000001101010… |
… | …1000001101001101100101 |
3 | 1120212220211211202200020020 |
4 | 2300100122220031031211 |
5 | 3041421344124202323 |
6 | 41432143134025353 |
7 | 2360036646503016 |
oct | 260203250151545 |
9 | 46786754680206 |
10 | 12112254522213 |
11 | 394a861a0390a |
12 | 1437529648259 |
13 | 69b246cca9b1 |
14 | 2dc34439300d |
15 | 160102e04ae3 |
hex | b041aa0d365 |
12112254522213 has 8 divisors (see below), whose sum is σ = 16149708504576. Its totient is φ = 8074818444000.
The previous prime is 12112254522191. The next prime is 12112254522233. The reversal of 12112254522213 is 31222545221121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12112254522213 - 216 = 12112254456677 is a prime.
It is a super-2 number, since 2×121122545222132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112254522233) 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, 2808808 + ... + 5666913.
It is an arithmetic number, because the mean of its divisors is an integer number (2018713563072).
Almost surely, 212112254522213 is an apocalyptic number.
It is an amenable number.
12112254522213 is a deficient number, since it is larger than the sum of its proper divisors (4037453982363).
12112254522213 is an equidigital number, since it uses as much as digits as its factorization.
12112254522213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8952075.
The product of its digits is 19200, while the sum is 33.
Adding to 12112254522213 its reverse (31222545221121), we get a palindrome (43334799743334).
The spelling of 12112254522213 in words is "twelve trillion, one hundred twelve billion, two hundred fifty-four million, five hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •