Base | Representation |
---|---|
bin | 11110001100100101010001… |
… | …00001001000111001001001 |
3 | 22201010001210202021110010120 |
4 | 33012102220201020321021 |
5 | 32200421342020440000 |
6 | 353121043234133453 |
7 | 16662313531126344 |
oct | 1706225041107111 |
9 | 281101722243116 |
10 | 66403021655625 |
11 | 1a1813aa668506 |
12 | 7545425721289 |
13 | 2b08a16573a15 |
14 | 1257ccdb2b45b |
15 | 7a24658546a0 |
hex | 3c64a8848e49 |
66403021655625 has 40 divisors (see below), whose sum is σ = 110640771120000. Its totient is φ = 35413509768000.
The previous prime is 66403021655563. The next prime is 66403021655629. The reversal of 66403021655625 is 52655612030466.
It is not a de Polignac number, because 66403021655625 - 212 = 66403021651529 is a prime.
It is a super-2 number, since 2×664030216556252 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (66403021655629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 46389376 + ... + 47799374.
It is an arithmetic number, because the mean of its divisors is an integer number (2766019278000).
Almost surely, 266403021655625 is an apocalyptic number.
It is an amenable number.
66403021655625 is a deficient number, since it is larger than the sum of its proper divisors (44237749464375).
66403021655625 is a wasteful number, since it uses less digits than its factorization.
66403021655625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1435139 (or 1435124 counting only the distinct ones).
The product of its (nonzero) digits is 7776000, while the sum is 51.
The spelling of 66403021655625 in words is "sixty-six trillion, four hundred three billion, twenty-one million, six hundred fifty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •