Base | Representation |
---|---|
bin | 1000001010001001… |
… | …1000000110001101 |
3 | 12122121222001101000 |
4 | 2002202120012031 |
5 | 13441123042202 |
6 | 1001152210513 |
7 | 105162054324 |
oct | 20242300615 |
9 | 5577861330 |
10 | 2190049677 |
11 | a24253812 |
12 | 511539a39 |
13 | 28b9595aa |
14 | 16ac0b0bb |
15 | cc40391c |
hex | 8289818d |
2190049677 has 16 divisors (see below), whose sum is σ = 3265190080. Its totient is φ = 1450730736.
The previous prime is 2190049669. The next prime is 2190049681. The reversal of 2190049677 is 7769400912.
2190049677 is a `hidden beast` number, since 2 + 1 + 90 + 0 + 496 + 77 = 666.
It is not a de Polignac number, because 2190049677 - 23 = 2190049669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2190049577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254083 + ... + 262560.
It is an arithmetic number, because the mean of its divisors is an integer number (204074380).
Almost surely, 22190049677 is an apocalyptic number.
2190049677 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2190049677 is a deficient number, since it is larger than the sum of its proper divisors (1075140403).
2190049677 is a wasteful number, since it uses less digits than its factorization.
2190049677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516809 (or 516803 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 45.
The square root of 2190049677 is about 46797.9665904407. The cubic root of 2190049677 is about 1298.6276794588.
The spelling of 2190049677 in words is "two billion, one hundred ninety million, forty-nine thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •