Base | Representation |
---|---|
bin | 100110111000101010… |
… | …1000000000000111000 |
3 | 21222112122201112211012 |
4 | 1031301111000000320 |
5 | 2332004430142422 |
6 | 102210105053052 |
7 | 6014230546610 |
oct | 1156125000070 |
9 | 258478645735 |
10 | 83505709112 |
11 | 32461883241 |
12 | 14225a87188 |
13 | 7b4a51cbc7 |
14 | 40825c1a40 |
15 | 228b1574e2 |
hex | 1371540038 |
83505709112 has 128 divisors (see below), whose sum is σ = 195990036480. Its totient is φ = 32527872000.
The previous prime is 83505709087. The next prime is 83505709127. The reversal of 83505709112 is 21190750538.
It is a self number, because there is not a number n which added to its sum of digits gives 83505709112.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 15373037 + ... + 15378467.
It is an arithmetic number, because the mean of its divisors is an integer number (1531172160).
Almost surely, 283505709112 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 83505709112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97995018240).
83505709112 is an abundant number, since it is smaller than the sum of its proper divisors (112484327368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83505709112 is a wasteful number, since it uses less digits than its factorization.
83505709112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6013 (or 6009 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 41.
The spelling of 83505709112 in words is "eighty-three billion, five hundred five million, seven hundred nine thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •