Base | Representation |
---|---|
bin | 111110110110100010… |
… | …010000100000000000 |
3 | 20110012021120221002000 |
4 | 332312202100200000 |
5 | 2101203124140412 |
6 | 51000355224000 |
7 | 4606250360352 |
oct | 766642204000 |
9 | 213167527060 |
10 | 67486943232 |
11 | 26691690355 |
12 | 110b52a8000 |
13 | 64968c6207 |
14 | 33a2d670d2 |
15 | 1b4eba64dc |
hex | fb6890800 |
67486943232 has 192 divisors, whose sum is σ = 200949840000. Its totient is φ = 22378954752.
The previous prime is 67486943221. The next prime is 67486943269. The reversal of 67486943232 is 23234968476.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 11000838 + ... + 11006970.
It is an arithmetic number, because the mean of its divisors is an integer number (1046613750).
Almost surely, 267486943232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67486943232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100474920000).
67486943232 is an abundant number, since it is smaller than the sum of its proper divisors (133462896768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67486943232 is a wasteful number, since it uses less digits than its factorization.
67486943232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6363 (or 6337 counting only the distinct ones).
The product of its digits is 10450944, while the sum is 54.
The spelling of 67486943232 in words is "sixty-seven billion, four hundred eighty-six million, nine hundred forty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •