Base | Representation |
---|---|
bin | 11101000100110011100… |
… | …000001110000110110101 |
3 | 21002000020201102101220000 |
4 | 131010303200032012311 |
5 | 230213423103031140 |
6 | 4125513545501513 |
7 | 264231615510450 |
oct | 35046340160665 |
9 | 7060221371800 |
10 | 1998023877045 |
11 | 7003a2432419 |
12 | 2832921a1899 |
13 | 11654a02a051 |
14 | 6c9c224c497 |
15 | 36e8e784a30 |
hex | 1d13380e1b5 |
1998023877045 has 160 divisors (see below), whose sum is σ = 4119977005056. Its totient is φ = 907443648000.
The previous prime is 1998023877041. The next prime is 1998023877053. The reversal of 1998023877045 is 5407783208991.
It is not a de Polignac number, because 1998023877045 - 22 = 1998023877041 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1998023877041) by changing a digit.
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 159 ways as a sum of consecutive naturals, for example, 539858695 + ... + 539862395.
Almost surely, 21998023877045 is an apocalyptic number.
1998023877045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1998023877045 is an abundant number, since it is smaller than the sum of its proper divisors (2121953128011).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1998023877045 is a wasteful number, since it uses less digits than its factorization.
1998023877045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4913 (or 4904 counting only the distinct ones).
The product of its (nonzero) digits is 30481920, while the sum is 63.
The spelling of 1998023877045 in words is "one trillion, nine hundred ninety-eight billion, twenty-three million, eight hundred seventy-seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •