Base | Representation |
---|---|
bin | 1001010011001011011110… |
… | …0110100101111110000100 |
3 | 1100012111202222022200011121 |
4 | 2110302313212211332010 |
5 | 2320012002220341004 |
6 | 33425203001043324 |
7 | 2103511400206432 |
oct | 224626746457604 |
9 | 40174688280147 |
10 | 10225102512004 |
11 | 3292494889006 |
12 | 119183a186544 |
13 | 5922b8cc3ba3 |
14 | 274c7d03dd52 |
15 | 12aea2088854 |
hex | 94cb79a5f84 |
10225102512004 has 12 divisors (see below), whose sum is σ = 17944620416604. Its totient is φ = 5098068107264.
The previous prime is 10225102511971. The next prime is 10225102512013. The reversal of 10225102512004 is 40021520152201.
It can be written as a sum of positive squares in 2 ways, for example, as 1352806262404 + 8872296249600 = 1163102^2 + 2978640^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10225102512004.
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 3 ways as a sum of consecutive naturals, for example, 3620785597 + ... + 3620788420.
It is an arithmetic number, because the mean of its divisors is an integer number (1495385034717).
Almost surely, 210225102512004 is an apocalyptic number.
It is an amenable number.
10225102512004 is a deficient number, since it is larger than the sum of its proper divisors (7719517904600).
10225102512004 is a wasteful number, since it uses less digits than its factorization.
10225102512004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7241574374 (or 7241574372 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 25.
Adding to 10225102512004 its reverse (40021520152201), we get a palindrome (50246622664205).
The spelling of 10225102512004 in words is "ten trillion, two hundred twenty-five billion, one hundred two million, five hundred twelve thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •