Base | Representation |
---|---|
bin | 1001010100001111010001… |
… | …1001000110000001010001 |
3 | 1100021020202100100021211001 |
4 | 2111003310121012001101 |
5 | 2320311240334041000 |
6 | 33441412540422001 |
7 | 2105024402355631 |
oct | 225036431060121 |
9 | 40236670307731 |
10 | 10243302252625 |
11 | 329a184096562 |
12 | 1195279247901 |
13 | 593c2971a690 |
14 | 275ac81c26c1 |
15 | 12b6b9c4946a |
hex | 950f4646051 |
10243302252625 has 64 divisors (see below), whose sum is σ = 13849148109888. Its totient is φ = 7519184640000.
The previous prime is 10243302252577. The next prime is 10243302252709. The reversal of 10243302252625 is 52625220334201.
It can be written as a sum of positive squares in 32 ways, for example, as 9094126828609 + 1149175424016 = 3015647^2 + 1071996^2 .
It is not a de Polignac number, because 10243302252625 - 27 = 10243302252497 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 816778855 + ... + 816791395.
It is an arithmetic number, because the mean of its divisors is an integer number (216392939217).
Almost surely, 210243302252625 is an apocalyptic number.
It is an amenable number.
10243302252625 is a deficient number, since it is larger than the sum of its proper divisors (3605845857263).
10243302252625 is a wasteful number, since it uses less digits than its factorization.
10243302252625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15527 (or 15517 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 37.
Adding to 10243302252625 its reverse (52625220334201), we get a palindrome (62868522586826).
The spelling of 10243302252625 in words is "ten trillion, two hundred forty-three billion, three hundred two million, two hundred fifty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •