Base | Representation |
---|---|
bin | 1111010100110… |
… | …0010011011000 |
3 | 11110221112122110 |
4 | 3311030103120 |
5 | 112423310142 |
6 | 10213352320 |
7 | 1410222426 |
oct | 365142330 |
9 | 143845573 |
10 | 64275672 |
11 | 3331129a |
12 | 196386a0 |
13 | 10416156 |
14 | 8772116 |
15 | 599999c |
hex | 3d4c4d8 |
64275672 has 16 divisors (see below), whose sum is σ = 160689240. Its totient is φ = 21425216.
The previous prime is 64275671. The next prime is 64275677. The reversal of 64275672 is 27657246.
It is a happy number.
64275672 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×642756722 = 8262724022103168, which contains 22 as substring.
It is a plaindrome in base 15.
It is a self number, because there is not a number n which added to its sum of digits gives 64275672.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64275671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1339053 + ... + 1339100.
Almost surely, 264275672 is an apocalyptic number.
It is an amenable number.
64275672 is an abundant number, since it is smaller than the sum of its proper divisors (96413568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64275672 is a wasteful number, since it uses less digits than its factorization.
64275672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2678162 (or 2678158 counting only the distinct ones).
The product of its digits is 141120, while the sum is 39.
The square root of 64275672 is about 8017.2109863718. The cubic root of 64275672 is about 400.5734940352.
The spelling of 64275672 in words is "sixty-four million, two hundred seventy-five thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •