Base | Representation |
---|---|
bin | 111100110011000… |
… | …110000010101110 |
3 | 2122002100202001210 |
4 | 330303012002232 |
5 | 4042111331204 |
6 | 245114415250 |
7 | 34164041544 |
oct | 7463060256 |
9 | 2562322053 |
10 | 1020027054 |
11 | 483862472 |
12 | 245731526 |
13 | 13342ca07 |
14 | 99681d94 |
15 | 5e83a389 |
hex | 3ccc60ae |
1020027054 has 8 divisors (see below), whose sum is σ = 2040054120. Its totient is φ = 340009016.
The previous prime is 1020027049. The next prime is 1020027079. The reversal of 1020027054 is 4507200201.
1020027054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
1020027054 is an admirable number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1020027054.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85002249 + ... + 85002260.
It is an arithmetic number, because the mean of its divisors is an integer number (255006765).
Almost surely, 21020027054 is an apocalyptic number.
1020027054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020027054 is a wasteful number, since it uses less digits than its factorization.
1020027054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170004514.
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 1020027054 is about 31937.8623893334. The cubic root of 1020027054 is about 1006.6316092104.
Adding to 1020027054 its reverse (4507200201), we get a palindrome (5527227255).
The spelling of 1020027054 in words is "one billion, twenty million, twenty-seven thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •