Base | Representation |
---|---|
bin | 11101010010000010110… |
… | …111010100011001110111 |
3 | 21010100221111000011112220 |
4 | 131102002313110121313 |
5 | 230432031444442403 |
6 | 4140224351413423 |
7 | 265244121530541 |
oct | 35220267243167 |
9 | 7110844004486 |
10 | 2012240234103 |
11 | 706428175940 |
12 | 285b9b224273 |
13 | 1179a43cc448 |
14 | 6d570364691 |
15 | 375228a3953 |
hex | 1d482dd4677 |
2012240234103 has 8 divisors (see below), whose sum is σ = 2926894886016. Its totient is φ = 1219539535800.
The previous prime is 2012240234101. The next prime is 2012240234107. The reversal of 2012240234103 is 3014320422102.
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 2012240234103 - 21 = 2012240234101 is a prime.
It is a super-5 number, since 5×20122402341035 (a number of 63 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012240234101) 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, 30488488363 + ... + 30488488428.
It is an arithmetic number, because the mean of its divisors is an integer number (365861860752).
Almost surely, 22012240234103 is an apocalyptic number.
2012240234103 is a deficient number, since it is larger than the sum of its proper divisors (914654651913).
2012240234103 is a wasteful number, since it uses less digits than its factorization.
2012240234103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60976976805.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 2012240234103 its reverse (3014320422102), we get a palindrome (5026560656205).
The spelling of 2012240234103 in words is "two trillion, twelve billion, two hundred forty million, two hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •