Base | Representation |
---|---|
bin | 10011000100101101110… |
… | …00011010111010000000 |
3 | 2022122121121111200021021 |
4 | 21202112320122322000 |
5 | 41214142244323124 |
6 | 1221023212235224 |
7 | 65230406333452 |
oct | 11422670327200 |
9 | 2278547450237 |
10 | 655366401664 |
11 | 232a37280647 |
12 | a7020a6bb14 |
13 | 49a54435620 |
14 | 23a115b22d2 |
15 | 120aa8e27e4 |
hex | 9896e1ae80 |
655366401664 has 64 divisors (see below), whose sum is σ = 1412185257000. Its totient is φ = 301155766272.
The previous prime is 655366401631. The next prime is 655366401689. The reversal of 655366401664 is 466104663556.
It can be written as a sum of positive squares in 4 ways, for example, as 643268161600 + 12098240064 = 802040^2 + 109992^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 478879 + ... + 1240990.
Almost surely, 2655366401664 is an apocalyptic number.
655366401664 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
655366401664 is an abundant number, since it is smaller than the sum of its proper divisors (756818855336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
655366401664 is a wasteful number, since it uses less digits than its factorization.
655366401664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1720125 (or 1720113 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 52.
The spelling of 655366401664 in words is "six hundred fifty-five billion, three hundred sixty-six million, four hundred one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •