Base | Representation |
---|---|
bin | 1011000110011000101110… |
… | …0101101111001001110001 |
3 | 1121012201112201101112102222 |
4 | 2301212023211233021301 |
5 | 3044423444031412200 |
6 | 41542333115250425 |
7 | 2366510010324464 |
oct | 261461345571161 |
9 | 47181481345388 |
10 | 12204344013425 |
11 | 3985919035643 |
12 | 145134a149a15 |
13 | 6a6b3199b7b5 |
14 | 30299c9a32db |
15 | 1626e291ed85 |
hex | b198b96f271 |
12204344013425 has 24 divisors (see below), whose sum is σ = 16203626127000. Its totient is φ = 9085904199680.
The previous prime is 12204344013409. The next prime is 12204344013469. The reversal of 12204344013425 is 52431044340221.
It can be written as a sum of positive squares in 12 ways, for example, as 7211550397489 + 4992793615936 = 2685433^2 + 2234456^2 .
It is not a de Polignac number, because 12204344013425 - 24 = 12204344013409 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 161288600 + ... + 161364249.
It is an arithmetic number, because the mean of its divisors is an integer number (675151088625).
Almost surely, 212204344013425 is an apocalyptic number.
It is an amenable number.
12204344013425 is a deficient number, since it is larger than the sum of its proper divisors (3999282113575).
12204344013425 is a wasteful number, since it uses less digits than its factorization.
12204344013425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322652965 (or 322652960 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 12204344013425 its reverse (52431044340221), we get a palindrome (64635388353646).
The spelling of 12204344013425 in words is "twelve trillion, two hundred four billion, three hundred forty-four million, thirteen thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •