Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11000010001000001111 |
3 | 10121111210121211121012212 |
4 | 32311330303002020033 |
5 | 113202430224030444 |
6 | 2100325413221035 |
7 | 133456401315140 |
oct | 16657463021017 |
9 | 3544717747185 |
10 | 1020001001999 |
11 | 363641a79811 |
12 | 14582433177b |
13 | 75254c34575 |
14 | 3752290dac7 |
15 | 1b7ec62e19e |
hex | ed7ccc220f |
1020001001999 has 8 divisors (see below), whose sum is σ = 1203319154688. Its totient is φ = 846083780280.
The previous prime is 1020001001969. The next prime is 1020001002011. The reversal of 1020001001999 is 9991001000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020001001999 - 212 = 1020000997903 is a prime.
It is a super-3 number, since 3×10200010019993 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020001001969) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2350232507 + ... + 2350232940.
It is an arithmetic number, because the mean of its divisors is an integer number (150414894336).
Almost surely, 21020001001999 is an apocalyptic number.
1020001001999 is a deficient number, since it is larger than the sum of its proper divisors (183318152689).
1020001001999 is an equidigital number, since it uses as much as digits as its factorization.
1020001001999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4700465485.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 1020001001999 in words is "one trillion, twenty billion, one million, one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •