Base | Representation |
---|---|
bin | 1011000100001000001… |
… | …1111101010001101100 |
3 | 200011122111000202111021 |
4 | 2301002003331101230 |
5 | 11103244221112300 |
6 | 223154045503524 |
7 | 16506346642243 |
oct | 2610203752154 |
9 | 604574022437 |
10 | 190086894700 |
11 | 7368510749a |
12 | 30a0b871ba4 |
13 | 14c046373b1 |
14 | 92b36db95a |
15 | 4e2802cd1a |
hex | 2c420fd46c |
190086894700 has 18 divisors (see below), whose sum is σ = 412488561716. Its totient is φ = 76034757840.
The previous prime is 190086894691. The next prime is 190086894709. The reversal of 190086894700 is 7498680091.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (190086894691) and next prime (190086894709).
It is a super-2 number, since 2×1900868947002 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (190086894709) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 950434374 + ... + 950434573.
Almost surely, 2190086894700 is an apocalyptic number.
190086894700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
190086894700 is an abundant number, since it is smaller than the sum of its proper divisors (222401667016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190086894700 is a wasteful number, since it uses less digits than its factorization.
190086894700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1900868961 (or 1900868954 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 190086894700 in words is "one hundred ninety billion, eighty-six million, eight hundred ninety-four thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •