Base | Representation |
---|---|
bin | 1011001000011110011001… |
… | …0011001001001000001110 |
3 | 1121100011011100221012110010 |
4 | 2302013212103021020032 |
5 | 3101020440223312420 |
6 | 42011025414254050 |
7 | 2402220125654160 |
oct | 262074623111016 |
9 | 47304140835403 |
10 | 12240225604110 |
11 | 399a061284819 |
12 | 14582a2957326 |
13 | 6aa32c74176a |
14 | 3046041d6930 |
15 | 1635e2a924e0 |
hex | b21e64c920e |
12240225604110 has 64 divisors (see below), whose sum is σ = 35548083781632. Its totient is φ = 2633191389696.
The previous prime is 12240225604109. The next prime is 12240225604129. The reversal of 12240225604110 is 1140652204221.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1714313742 + ... + 1714320881.
It is an arithmetic number, because the mean of its divisors is an integer number (555438809088).
Almost surely, 212240225604110 is an apocalyptic number.
12240225604110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12240225604110 is an abundant number, since it is smaller than the sum of its proper divisors (23307858177522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12240225604110 is a wasteful number, since it uses less digits than its factorization.
12240225604110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3428634657.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 12240225604110 its reverse (1140652204221), we get a palindrome (13380877808331).
The spelling of 12240225604110 in words is "twelve trillion, two hundred forty billion, two hundred twenty-five million, six hundred four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •