Base | Representation |
---|---|
bin | 111100111010010101… |
… | …011000111110000000 |
3 | 20020211001122120020100 |
4 | 330322111120332000 |
5 | 2032421204222024 |
6 | 50013521242400 |
7 | 4503515662401 |
oct | 747225307600 |
9 | 206731576210 |
10 | 65403195264 |
11 | 258124426a0 |
12 | 10813493400 |
13 | 6223ca8854 |
14 | 324630b9a8 |
15 | 1a7bc9e7c9 |
hex | f3a558f80 |
65403195264 has 192 divisors, whose sum is σ = 205645892400. Its totient is φ = 19787120640.
The previous prime is 65403195259. The next prime is 65403195287. The reversal of 65403195264 is 46259130456.
65403195264 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8524422 + ... + 8532090.
Almost surely, 265403195264 is an apocalyptic number.
65403195264 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65403195264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102822946200).
65403195264 is an abundant number, since it is smaller than the sum of its proper divisors (140242697136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65403195264 is a wasteful number, since it uses less digits than its factorization.
65403195264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8373 (or 8358 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 45.
The spelling of 65403195264 in words is "sixty-five billion, four hundred three million, one hundred ninety-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •