Base | Representation |
---|---|
bin | 111011010001111… |
… | …0011001001110010 |
3 | 12010121211112211002 |
4 | 1312203303021302 |
5 | 13033202033200 |
6 | 525213122002 |
7 | 100202015564 |
oct | 16643631162 |
9 | 5117745732 |
10 | 1989096050 |
11 | 93087a337 |
12 | 476189302 |
13 | 25912a216 |
14 | 14c25b334 |
15 | b995bbd5 |
hex | 768f3272 |
1989096050 has 48 divisors (see below), whose sum is σ = 3922764552. Its totient is φ = 747801600.
The previous prime is 1989096047. The next prime is 1989096077. The reversal of 1989096050 is 506909891.
It can be written as a sum of positive squares in 12 ways, for example, as 1435576321 + 553519729 = 37889^2 + 23527^2 .
It is a super-2 number, since 2×19890960502 = 7913006192251205000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1989095986 and 1989096004.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 927980 + ... + 930120.
Almost surely, 21989096050 is an apocalyptic number.
1989096050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1989096050 is a deficient number, since it is larger than the sum of its proper divisors (1933668502).
1989096050 is a wasteful number, since it uses less digits than its factorization.
1989096050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3263 (or 3258 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 47.
The square root of 1989096050 is about 44599.2830659866. The cubic root of 1989096050 is about 1257.6271901198.
The spelling of 1989096050 in words is "one billion, nine hundred eighty-nine million, ninety-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •