Base | Representation |
---|---|
bin | 1001010001111110011100… |
… | …0101100101110100111000 |
3 | 1100010112101212200012212022 |
4 | 2110133213011211310320 |
5 | 2314142130112034202 |
6 | 33411503043534012 |
7 | 2102150101443224 |
oct | 224374705456470 |
9 | 40115355605768 |
10 | 10204424330552 |
11 | 3284743562251 |
12 | 118982908a308 |
13 | 590371c78c6a |
14 | 273c7aa5d784 |
15 | 12a691a09ea2 |
hex | 947e7165d38 |
10204424330552 has 8 divisors (see below), whose sum is σ = 19133295619800. Its totient is φ = 5102212165272.
The previous prime is 10204424330533. The next prime is 10204424330579. The reversal of 10204424330552 is 25503342440201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-3 number, since 3×102044243305523 (a number of 40 digits) contains 333 as substring.
It is a congruent 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 as a sum of consecutive naturals, namely, 637776520652 + ... + 637776520667.
It is an arithmetic number, because the mean of its divisors is an integer number (2391661952475).
Almost surely, 210204424330552 is an apocalyptic number.
It is an amenable number.
10204424330552 is a deficient number, since it is larger than the sum of its proper divisors (8928871289248).
10204424330552 is a wasteful number, since it uses less digits than its factorization.
10204424330552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1275553041325 (or 1275553041321 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 10204424330552 its reverse (25503342440201), we get a palindrome (35707766770753).
The spelling of 10204424330552 in words is "ten trillion, two hundred four billion, four hundred twenty-four million, three hundred thirty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •