Base | Representation |
---|---|
bin | 1011000111001100101… |
… | …1111110100111101100 |
3 | 200020202220212202110120 |
4 | 2301303023332213230 |
5 | 11111441214042230 |
6 | 223411531004540 |
7 | 16535645261466 |
oct | 2616313764754 |
9 | 606686782416 |
10 | 190911080940 |
11 | 73a68367848 |
12 | 30bbb899750 |
13 | 15006307c68 |
14 | 9350d61136 |
15 | 4e75581310 |
hex | 2c732fe9ec |
190911080940 has 96 divisors (see below), whose sum is σ = 570764468736. Its totient is φ = 47563676160.
The previous prime is 190911080929. The next prime is 190911080959. The reversal of 190911080940 is 49080119091.
It is a happy number.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 190911080892 and 190911080901.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1549281 + ... + 1667960.
It is an arithmetic number, because the mean of its divisors is an integer number (5945463216).
Almost surely, 2190911080940 is an apocalyptic number.
190911080940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
190911080940 is an abundant number, since it is smaller than the sum of its proper divisors (379853387796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190911080940 is a wasteful number, since it uses less digits than its factorization.
190911080940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3217319 (or 3217317 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 42.
The spelling of 190911080940 in words is "one hundred ninety billion, nine hundred eleven million, eighty thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •