Base | Representation |
---|---|
bin | 101100011011100000111… |
… | …001101100111111010001 |
3 | 101210212211202110102222112 |
4 | 230123200321230333101 |
5 | 400010423200044100 |
6 | 10254342024115105 |
7 | 433405066551524 |
oct | 54334071547721 |
9 | 11725752412875 |
10 | 3053200003025 |
11 | a77944894427 |
12 | 413892605a95 |
13 | 191bb953c933 |
14 | a7ac0612bbb |
15 | 54649ed7b35 |
hex | 2c6e0e6cfd1 |
3053200003025 has 24 divisors (see below), whose sum is σ = 3917677433400. Its totient is φ = 2357636019200.
The previous prime is 3053200003001. The next prime is 3053200003097. The reversal of 3053200003025 is 5203000023503.
It can be written as a sum of positive squares in 12 ways, for example, as 18019303696 + 3035180699329 = 134236^2 + 1742177^2 .
It is a de Polignac number, because none of the positive numbers 2k-3053200003025 is a prime.
It is a super-3 number, since 3×30532000030253 (a number of 38 digits) contains 333 as substring.
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, 1835705 + ... + 3078345.
It is an arithmetic number, because the mean of its divisors is an integer number (163236559725).
Almost surely, 23053200003025 is an apocalyptic number.
It is an amenable number.
3053200003025 is a deficient number, since it is larger than the sum of its proper divisors (864477430375).
3053200003025 is a wasteful number, since it uses less digits than its factorization.
3053200003025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246069 (or 1246064 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 23.
Adding to 3053200003025 its reverse (5203000023503), we get a palindrome (8256200026528).
The spelling of 3053200003025 in words is "three trillion, fifty-three billion, two hundred million, three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •