Base | Representation |
---|---|
bin | 1011000110011000111110… |
… | …0010010110100101100010 |
3 | 1121012201201022222221200120 |
4 | 2301212033202112211202 |
5 | 3044424113010011414 |
6 | 41542343442501110 |
7 | 2366511443234130 |
oct | 261461742264542 |
9 | 47181638887616 |
10 | 12204410235234 |
11 | 3985952456008 |
12 | 1451368364796 |
13 | 6a6b426166b9 |
14 | 3029a76c0750 |
15 | 1626e86512a9 |
hex | b198f896962 |
12204410235234 has 16 divisors (see below), whose sum is σ = 27895794823488. Its totient is φ = 3486974352912.
The previous prime is 12204410235187. The next prime is 12204410235239. The reversal of 12204410235234 is 43253201440221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12204410235195 and 12204410235204.
It is not an unprimeable number, because it can be changed into a prime (12204410235239) 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, 145290597997 + ... + 145290598080.
It is an arithmetic number, because the mean of its divisors is an integer number (1743487176468).
Almost surely, 212204410235234 is an apocalyptic number.
12204410235234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
12204410235234 is an abundant number, since it is smaller than the sum of its proper divisors (15691384588254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12204410235234 is a wasteful number, since it uses less digits than its factorization.
12204410235234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290581196089.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 12204410235234 its reverse (43253201440221), we get a palindrome (55457611675455).
The spelling of 12204410235234 in words is "twelve trillion, two hundred four billion, four hundred ten million, two hundred thirty-five thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •