Base | Representation |
---|---|
bin | 10110110001001111… |
… | …01111011101000011 |
3 | 1011112221001021210000 |
4 | 23120213233131003 |
5 | 200013400344420 |
6 | 5340555411043 |
7 | 611633152056 |
oct | 133047573503 |
9 | 34487037700 |
10 | 12224231235 |
11 | 5203294947 |
12 | 2451a53a83 |
13 | 11ca754128 |
14 | 83d70aa9d |
15 | 4b82b4690 |
hex | 2d89ef743 |
12224231235 has 40 divisors (see below), whose sum is σ = 22668711120. Its totient is φ = 6294770496.
The previous prime is 12224231233. The next prime is 12224231311. The reversal of 12224231235 is 53213242221.
12224231235 is a `hidden beast` number, since 1 + 2 + 2 + 2 + 423 + 1 + 235 = 666.
It is not a de Polignac number, because 12224231235 - 21 = 12224231233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 12224231199 and 12224231208.
It is not an unprimeable number, because it can be changed into a prime (12224231233) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 508657 + ... + 532146.
It is an arithmetic number, because the mean of its divisors is an integer number (566717778).
Almost surely, 212224231235 is an apocalyptic number.
12224231235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12224231235 is a deficient number, since it is larger than the sum of its proper divisors (10444479885).
12224231235 is a wasteful number, since it uses less digits than its factorization.
12224231235 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1040849 (or 1040840 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
Adding to 12224231235 its reverse (53213242221), we get a palindrome (65437473456).
The spelling of 12224231235 in words is "twelve billion, two hundred twenty-four million, two hundred thirty-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •