Base | Representation |
---|---|
bin | 11011111000111001000010… |
… | …01100101111010000110001 |
3 | 22001010221022021221210010020 |
4 | 31330130201030233100301 |
5 | 31014301023110211100 |
6 | 334233513053354053 |
7 | 15626554541252136 |
oct | 1574344114572061 |
9 | 261127267853106 |
10 | 61328395007025 |
11 | 185a5254176353 |
12 | 6a65a2b498929 |
13 | 282b320677423 |
14 | 112044b0d658d |
15 | 71545b7685a0 |
hex | 37c72132f431 |
61328395007025 has 24 divisors (see below), whose sum is σ = 101432248977120. Its totient is φ = 32696874359040.
The previous prime is 61328395006997. The next prime is 61328395007071. The reversal of 61328395007025 is 52070059382316.
61328395007025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61328395007025 - 229 = 61327858136113 is a prime.
It is a super-2 number, since 2×613283950070252 (a number of 28 digits) contains 22 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, 144824392 + ... + 145247241.
It is an arithmetic number, because the mean of its divisors is an integer number (4226343707380).
Almost surely, 261328395007025 is an apocalyptic number.
It is an amenable number.
61328395007025 is a deficient number, since it is larger than the sum of its proper divisors (40103853970095).
61328395007025 is a wasteful number, since it uses less digits than its factorization.
61328395007025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290074465 (or 290074460 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 61328395007025 in words is "sixty-one trillion, three hundred twenty-eight billion, three hundred ninety-five million, seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •