Base | Representation |
---|---|
bin | 11101001001111110110100… |
… | …00011100010111001001000 |
3 | 22102000022002011102020100221 |
4 | 32210333122003202321020 |
5 | 31400423233102033312 |
6 | 344205505022235424 |
7 | 16335062300120143 |
oct | 1644773203427110 |
9 | 272008064366327 |
10 | 64114635189832 |
11 | 19479956110587 |
12 | 7235a19725b74 |
13 | 29a0ca42623a6 |
14 | 11b92446b705a |
15 | 762b7ea4a207 |
hex | 3a4fda0e2e48 |
64114635189832 has 16 divisors (see below), whose sum is σ = 120218318054640. Its totient is φ = 32056417041936.
The previous prime is 64114635189763. The next prime is 64114635189833. The reversal of 64114635189832 is 23898153641146.
64114635189832 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×641146351898322 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (64114635189833) 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 3 ways as a sum of consecutive naturals, for example, 112266498 + ... + 112836145.
It is an arithmetic number, because the mean of its divisors is an integer number (7513644878415).
Almost surely, 264114635189832 is an apocalyptic number.
It is an amenable number.
64114635189832 is a deficient number, since it is larger than the sum of its proper divisors (56103682864808).
64114635189832 is a wasteful number, since it uses less digits than its factorization.
64114635189832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225138252 (or 225138248 counting only the distinct ones).
The product of its digits is 29859840, while the sum is 61.
The spelling of 64114635189832 in words is "sixty-four trillion, one hundred fourteen billion, six hundred thirty-five million, one hundred eighty-nine thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •