Base | Representation |
---|---|
bin | 110111110101110110… |
… | …1110011001101011110 |
3 | 102110112100022122111112 |
4 | 1233223231303031132 |
5 | 3431043201101430 |
6 | 131031231222022 |
7 | 11443461501206 |
oct | 1575355631536 |
9 | 373470278445 |
10 | 119918768990 |
11 | 46948023059 |
12 | 1b2a8677912 |
13 | b401415897 |
14 | 5b3863d406 |
15 | 31bccac195 |
hex | 1bebb7335e |
119918768990 has 32 divisors (see below), whose sum is σ = 220493905920. Its totient is φ = 46936809504.
The previous prime is 119918768989. The next prime is 119918769001. The reversal of 119918768990 is 99867819911.
It is a super-2 number, since 2×1199187689902 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 119918768990.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2381009 + ... + 2430851.
It is an arithmetic number, because the mean of its divisors is an integer number (6890434560).
Almost surely, 2119918768990 is an apocalyptic number.
119918768990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
119918768990 is a deficient number, since it is larger than the sum of its proper divisors (100575136930).
119918768990 is a wasteful number, since it uses less digits than its factorization.
119918768990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55016.
The product of its (nonzero) digits is 17635968, while the sum is 68.
The spelling of 119918768990 in words is "one hundred nineteen billion, nine hundred eighteen million, seven hundred sixty-eight thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •