Base | Representation |
---|---|
bin | 11101011000111101111… |
… | …100111001111110001101 |
3 | 21011002010112221212200100 |
4 | 131120331330321332031 |
5 | 231042243021133024 |
6 | 4143454143121313 |
7 | 265626255535245 |
oct | 35307574717615 |
9 | 7132115855610 |
10 | 2019674005389 |
11 | 7095a2361277 |
12 | 2875148a3239 |
13 | 1185ba53c391 |
14 | 6da77756b25 |
15 | 3780a3027c9 |
hex | 1d63df39f8d |
2019674005389 has 24 divisors (see below), whose sum is σ = 2948914425600. Its totient is φ = 1331935869600.
The previous prime is 2019674005331. The next prime is 2019674005441. The reversal of 2019674005389 is 9835004769102.
2019674005389 is a `hidden beast` number, since 2 + 0 + 1 + 9 + 67 + 40 + 0 + 538 + 9 = 666.
It is not a de Polignac number, because 2019674005389 - 28 = 2019674005133 is a prime.
It is a super-3 number, since 3×20196740053893 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2019674005189) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2784294 + ... + 3433895.
It is an arithmetic number, because the mean of its divisors is an integer number (122871434400).
It is a 1-persistent number, because it is pandigital, but 2⋅2019674005389 = 4039348010778 is not.
Almost surely, 22019674005389 is an apocalyptic number.
It is an amenable number.
2019674005389 is a deficient number, since it is larger than the sum of its proper divisors (929240420211).
2019674005389 is a wasteful number, since it uses less digits than its factorization.
2019674005389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6218585 (or 6218582 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 2019674005389 in words is "two trillion, nineteen billion, six hundred seventy-four million, five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •