Base | Representation |
---|---|
bin | 110111100001100010… |
… | …0110010111001001110 |
3 | 102101202211022200211012 |
4 | 1233003010302321032 |
5 | 3423144123244100 |
6 | 130435433125222 |
7 | 11420542122611 |
oct | 1570304627116 |
9 | 371684280735 |
10 | 119236931150 |
11 | 46628159207 |
12 | 1b138259812 |
13 | b32309523c |
14 | 5ab1c72178 |
15 | 317cec6135 |
hex | 1bc3132e4e |
119236931150 has 12 divisors (see below), whose sum is σ = 221780692032. Its totient is φ = 47694772440.
The previous prime is 119236931147. The next prime is 119236931167. The reversal of 119236931150 is 51139632911.
It is a junction number, because it is equal to n+sod(n) for n = 119236931098 and 119236931107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1192369262 + ... + 1192369361.
It is an arithmetic number, because the mean of its divisors is an integer number (18481724336).
Almost surely, 2119236931150 is an apocalyptic number.
119236931150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
119236931150 is a deficient number, since it is larger than the sum of its proper divisors (102543760882).
119236931150 is a wasteful number, since it uses less digits than its factorization.
119236931150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2384738635 (or 2384738630 counting only the distinct ones).
The product of its (nonzero) digits is 43740, while the sum is 41.
The spelling of 119236931150 in words is "one hundred nineteen billion, two hundred thirty-six million, nine hundred thirty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •