Base | Representation |
---|---|
bin | 1011000110100010111… |
… | …0111101000000000000 |
3 | 200020022200212111000000 |
4 | 2301220232331000000 |
5 | 11111111314344333 |
6 | 223342304000000 |
7 | 16531415461632 |
oct | 2615056750000 |
9 | 606280774000 |
10 | 190735699968 |
11 | 7398836a4a0 |
12 | 30b71000000 |
13 | 14ca8b90638 |
14 | 933594aa52 |
15 | 4e64e8b713 |
hex | 2c68bbd000 |
190735699968 has 364 divisors, whose sum is σ = 623971770048. Its totient is φ = 57788743680.
The previous prime is 190735699951. The next prime is 190735699991. The reversal of 190735699968 is 869996537091.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 190735699896 and 190735699905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 32842921 + ... + 32848727.
Almost surely, 2190735699968 is an apocalyptic number.
190735699968 is a gapful number since it is divisible by the number (18) 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 190735699968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (311985885024).
190735699968 is an abundant number, since it is smaller than the sum of its proper divisors (433236070080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190735699968 is an frugal number, since it uses more digits than its factorization.
190735699968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5860 (or 5823 counting only the distinct ones).
The product of its (nonzero) digits is 198404640, while the sum is 72.
The spelling of 190735699968 in words is "one hundred ninety billion, seven hundred thirty-five million, six hundred ninety-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •