Base | Representation |
---|---|
bin | 111011111001010100… |
… | …110000011001010000 |
3 | 20011000001100000101000 |
4 | 323321110300121100 |
5 | 2023203000310112 |
6 | 45313400142000 |
7 | 4434503213151 |
oct | 737124603120 |
9 | 204001300330 |
10 | 64312510032 |
11 | 2530280a741 |
12 | 1056a167900 |
13 | 60ac039884 |
14 | 3181515928 |
15 | 1a161587dc |
hex | ef9530650 |
64312510032 has 40 divisors (see below), whose sum is σ = 184600724480. Its totient is φ = 21437503200.
The previous prime is 64312509983. The next prime is 64312510043. The reversal of 64312510032 is 23001521346.
64312510032 is a `hidden beast` number, since 643 + 1 + 2 + 5 + 10 + 0 + 3 + 2 = 666.
It is a super-2 number, since 2×643125100322 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 64312509978 and 64312510005.
It is a congruent number.
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, 74435344 + ... + 74436207.
It is an arithmetic number, because the mean of its divisors is an integer number (4615018112).
Almost surely, 264312510032 is an apocalyptic number.
It is an amenable number.
64312510032 is an abundant number, since it is smaller than the sum of its proper divisors (120288214448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64312510032 is a wasteful number, since it uses less digits than its factorization.
64312510032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148871568 (or 148871556 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 64312510032 in words is "sixty-four billion, three hundred twelve million, five hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •