Base | Representation |
---|---|
bin | 100001101000011110111… |
… | …111101101110011011101 |
3 | 22011221122100221001110110 |
4 | 201220132333231303131 |
5 | 300331330340040123 |
6 | 4525431211200233 |
7 | 325656666315414 |
oct | 41503677556335 |
9 | 8157570831413 |
10 | 2311212424413 |
11 | 8111a8184542 |
12 | 313b18446079 |
13 | 139c3c304b29 |
14 | 7dc12b9a47b |
15 | 401bebdb493 |
hex | 21a1efedcdd |
2311212424413 has 8 divisors (see below), whose sum is σ = 3081677897376. Its totient is φ = 1540777617200.
The previous prime is 2311212424403. The next prime is 2311212424427. The reversal of 2311212424413 is 3144242121132.
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 2311212424413 - 26 = 2311212424349 is a prime.
It is a super-2 number, since 2×23112124244132 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2311212424403) 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, 7489998 + ... + 7792463.
It is an arithmetic number, because the mean of its divisors is an integer number (385209737172).
Almost surely, 22311212424413 is an apocalyptic number.
It is an amenable number.
2311212424413 is a deficient number, since it is larger than the sum of its proper divisors (770465472963).
2311212424413 is a wasteful number, since it uses less digits than its factorization.
2311212424413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15332875.
The product of its digits is 9216, while the sum is 30.
Adding to 2311212424413 its reverse (3144242121132), we get a palindrome (5455454545545).
The spelling of 2311212424413 in words is "two trillion, three hundred eleven billion, two hundred twelve million, four hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •