Base | Representation |
---|---|
bin | 1011001001101000… |
… | …1001010001000110 |
3 | 21201121020012221202 |
4 | 2302122021101012 |
5 | 22112224320100 |
6 | 1213002342502 |
7 | 134113523135 |
oct | 26232112106 |
9 | 7647205852 |
10 | 2993198150 |
11 | 12a6645088 |
12 | 6b64baa32 |
13 | 389172587 |
14 | 20575591c |
15 | 127b9d7d5 |
hex | b2689446 |
2993198150 has 24 divisors (see below), whose sum is σ = 5809409424. Its totient is φ = 1145223200.
The previous prime is 2993198119. The next prime is 2993198179. The reversal of 2993198150 is 518913992.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2993198095 and 2993198104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1300241 + ... + 1302540.
It is an arithmetic number, because the mean of its divisors is an integer number (242058726).
Almost surely, 22993198150 is an apocalyptic number.
2993198150 is a deficient number, since it is larger than the sum of its proper divisors (2816211274).
2993198150 is a wasteful number, since it uses less digits than its factorization.
2993198150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602816 (or 2602811 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 47.
The square root of 2993198150 is about 54710.1284041630. The cubic root of 2993198150 is about 1441.1587493538.
The spelling of 2993198150 in words is "two billion, nine hundred ninety-three million, one hundred ninety-eight thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •