Base | Representation |
---|---|
bin | 11101101011111111101… |
… | …01100100110011111111 |
3 | 10121111221011210120022200 |
4 | 32311333311210303333 |
5 | 113203031302444444 |
6 | 2100334434242543 |
7 | 133460560640304 |
oct | 16657765446377 |
9 | 3544834716280 |
10 | 1020051999999 |
11 | 36366884131a |
12 | 145839426453 |
13 | 7526267bcb6 |
14 | 375295c70ab |
15 | 1b801d54969 |
hex | ed7fd64cff |
1020051999999 has 12 divisors (see below), whose sum is σ = 1473714383856. Its totient is φ = 679893463872.
The previous prime is 1020051999979. The next prime is 1020052000027. The reversal of 1020051999999 is 9999991500201.
1020051999999 is a `hidden beast` number, since 1 + 0 + 20 + 0 + 519 + 9 + 9 + 9 + 99 = 666.
It is not a de Polignac number, because 1020051999999 - 27 = 1020051999871 is a prime.
It is a hoax number, since the sum of its digits (63) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020051999959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11721139 + ... + 11807844.
It is an arithmetic number, because the mean of its divisors is an integer number (122809531988).
Almost surely, 21020051999999 is an apocalyptic number.
1020051999999 is a deficient number, since it is larger than the sum of its proper divisors (453662383857).
1020051999999 is a wasteful number, since it uses less digits than its factorization.
1020051999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23533806 (or 23533803 counting only the distinct ones).
The product of its (nonzero) digits is 5314410, while the sum is 63.
The spelling of 1020051999999 in words is "one trillion, twenty billion, fifty-one million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •