Base | Representation |
---|---|
bin | 11101011001010101100110… |
… | …10101111001011010100100 |
3 | 22110212201222201010102000010 |
4 | 32230222303111321122210 |
5 | 31433044330231313120 |
6 | 345252125232050220 |
7 | 16421151425511144 |
oct | 1654526325713244 |
9 | 273781881112003 |
10 | 64642266666660 |
11 | 196626a4349541 |
12 | 7300130393970 |
13 | 2a0b97cb5a847 |
14 | 11d69b955a924 |
15 | 77176139c7e0 |
hex | 3acab35796a4 |
64642266666660 has 48 divisors (see below), whose sum is σ = 181103517407232. Its totient is φ = 17227921516800.
The previous prime is 64642266666643. The next prime is 64642266666667. The reversal of 64642266666660 is 6666666224646.
It is a junction number, because it is equal to n+sod(n) for n = 64642266666591 and 64642266666600.
It is not an unprimeable number, because it can be changed into a prime (64642266666667) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 312904036 + ... + 313110555.
It is an arithmetic number, because the mean of its divisors is an integer number (3772989945984).
Almost surely, 264642266666660 is an apocalyptic number.
64642266666660 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
64642266666660 is an abundant number, since it is smaller than the sum of its proper divisors (116461250740572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64642266666660 is a wasteful number, since it uses less digits than its factorization.
64642266666660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626016324 (or 626016322 counting only the distinct ones).
The product of its (nonzero) digits is 644972544, while the sum is 66.
The spelling of 64642266666660 in words is "sixty-four trillion, six hundred forty-two billion, two hundred sixty-six million, six hundred sixty-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •