Base | Representation |
---|---|
bin | 11101001011000100110001… |
… | …11000010011101001100111 |
3 | 22102010220000212111221220110 |
4 | 32211202120320103221213 |
5 | 31402032144241233224 |
6 | 344235040122104103 |
7 | 16340562142314225 |
oct | 1645423070235147 |
9 | 272126025457813 |
10 | 64152196430439 |
11 | 19493880493597 |
12 | 724116094b033 |
13 | 29a46abca8050 |
14 | 11bada9015b15 |
15 | 763b2c3a1929 |
hex | 3a5898e13a67 |
64152196430439 has 16 divisors (see below), whose sum is σ = 92116411245152. Its totient is φ = 39478087490688.
The previous prime is 64152196430429. The next prime is 64152196430479. The reversal of 64152196430439 is 93403469125146.
It is a happy number.
64152196430439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 64152196430439 - 25 = 64152196430407 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64152196430429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4665897 + ... + 12250509.
It is an arithmetic number, because the mean of its divisors is an integer number (5757275702822).
Almost surely, 264152196430439 is an apocalyptic number.
64152196430439 is a deficient number, since it is larger than the sum of its proper divisors (27964214814713).
64152196430439 is a wasteful number, since it uses less digits than its factorization.
64152196430439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7801506.
The product of its (nonzero) digits is 16796160, while the sum is 57.
The spelling of 64152196430439 in words is "sixty-four trillion, one hundred fifty-two billion, one hundred ninety-six million, four hundred thirty thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •