Base | Representation |
---|---|
bin | 11011010101110000001001… |
… | …10010101010111101010001 |
3 | 21212212111220010120201022220 |
4 | 31222320010302222331101 |
5 | 30340010333321221200 |
6 | 331511115431051253 |
7 | 15443413143163545 |
oct | 1552700462527521 |
9 | 255774803521286 |
10 | 60121032601425 |
11 | 1817a206607a34 |
12 | 68aba38210b29 |
13 | 2771509978b03 |
14 | 10bbc32c75a25 |
15 | 6e3d455294a0 |
hex | 36ae04caaf51 |
60121032601425 has 48 divisors (see below), whose sum is σ = 100344756637632. Its totient is φ = 31760849433600.
The previous prime is 60121032601403. The next prime is 60121032601433. The reversal of 60121032601425 is 52410623012106.
60121032601425 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 60121032601425 - 223 = 60121024212817 is a prime.
It is a super-2 number, since 2×601210326014252 (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 47 ways as a sum of consecutive naturals, for example, 1706071 + ... + 11097420.
It is an arithmetic number, because the mean of its divisors is an integer number (2090515763284).
Almost surely, 260121032601425 is an apocalyptic number.
It is an amenable number.
60121032601425 is a deficient number, since it is larger than the sum of its proper divisors (40223724036207).
60121032601425 is a wasteful number, since it uses less digits than its factorization.
60121032601425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12804098 (or 12804093 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 60121032601425 in words is "sixty trillion, one hundred twenty-one billion, thirty-two million, six hundred one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •