Base | Representation |
---|---|
bin | 111011001001110000110… |
… | …011101110000000000000 |
3 | 112101121022002002012022120 |
4 | 323021300303232000000 |
5 | 1013044440001333333 |
6 | 12351223121004240 |
7 | 566452540036413 |
oct | 73116063560000 |
9 | 15347262065276 |
10 | 4064931667968 |
11 | 1327a22a54886 |
12 | 557989483680 |
13 | 2364241aac42 |
14 | 100a5ab87b7a |
15 | 70b11667db3 |
hex | 3b270cee000 |
4064931667968 has 112 divisors (see below), whose sum is σ = 10853638415616. Its totient is φ = 1353166848000.
The previous prime is 4064931667957. The next prime is 4064931667987. The reversal of 4064931667968 is 8697661394604.
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, 18346455 + ... + 18566697.
Almost surely, 24064931667968 is an apocalyptic number.
4064931667968 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4064931667968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5426819207808).
4064931667968 is an abundant number, since it is smaller than the sum of its proper divisors (6788706747648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4064931667968 is an equidigital number, since it uses as much as digits as its factorization.
4064931667968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221023 (or 220999 counting only the distinct ones).
The product of its (nonzero) digits is 282175488, while the sum is 69.
The spelling of 4064931667968 in words is "four trillion, sixty-four billion, nine hundred thirty-one million, six hundred sixty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •