Base | Representation |
---|---|
bin | 100111100000010010… |
… | …1101111001100000000 |
3 | 22002222022221202110111 |
4 | 1033000211233030000 |
5 | 2342220341343304 |
6 | 102550051041104 |
7 | 6062205552430 |
oct | 1170045571400 |
9 | 262868852414 |
10 | 84835496704 |
11 | 32a84476352 |
12 | 145372a0194 |
13 | 7cccb8727a |
14 | 416b0582c0 |
15 | 2317c7d704 |
hex | 13c096f300 |
84835496704 has 144 divisors (see below), whose sum is σ = 199804695552. Its totient is φ = 35194650624.
The previous prime is 84835496701. The next prime is 84835496749. The reversal of 84835496704 is 40769453848.
It is a happy number.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (84835496701) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8702457 + ... + 8712199.
It is an arithmetic number, because the mean of its divisors is an integer number (1387532608).
Almost surely, 284835496704 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 84835496704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99902347776).
84835496704 is an abundant number, since it is smaller than the sum of its proper divisors (114969198848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
84835496704 is a wasteful number, since it uses less digits than its factorization.
84835496704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9922 (or 9908 counting only the distinct ones).
The product of its (nonzero) digits is 23224320, while the sum is 58.
The spelling of 84835496704 in words is "eighty-four billion, eight hundred thirty-five million, four hundred ninety-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •