Base | Representation |
---|---|
bin | 11101010010000010110… |
… | …110110011111111001011 |
3 | 21010100221110202102102010 |
4 | 131102002312303333023 |
5 | 230432031431220243 |
6 | 4140224344511003 |
7 | 265244120435454 |
oct | 35220266637713 |
9 | 7110843672363 |
10 | 2012240101323 |
11 | 706428095101 |
12 | 285b9b17b463 |
13 | 1179a4383b8a |
14 | 6d57032c12b |
15 | 37522879433 |
hex | 1d482db3fcb |
2012240101323 has 8 divisors (see below), whose sum is σ = 2684662627536. Its totient is φ = 1340655488000.
The previous prime is 2012240101321. The next prime is 2012240101331. The reversal of 2012240101323 is 3231010422102.
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 2012240101323 - 21 = 2012240101321 is a prime.
It is a super-2 number, since 2×20122401013232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2012240101323.
It is not an unprimeable number, because it can be changed into a prime (2012240101321) 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, 209472618 + ... + 209482223.
It is an arithmetic number, because the mean of its divisors is an integer number (335582828442).
Almost surely, 22012240101323 is an apocalyptic number.
2012240101323 is a deficient number, since it is larger than the sum of its proper divisors (672422526213).
2012240101323 is a wasteful number, since it uses less digits than its factorization.
2012240101323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 418956445.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2012240101323 its reverse (3231010422102), we get a palindrome (5243250523425).
The spelling of 2012240101323 in words is "two trillion, twelve billion, two hundred forty million, one hundred one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •