Base | Representation |
---|---|
bin | 111100110101110… |
… | …000111100000010 |
3 | 2122010200022021021 |
4 | 330311300330002 |
5 | 4042301231132 |
6 | 245141420054 |
7 | 34203015406 |
oct | 7465607402 |
9 | 2563608237 |
10 | 1020727042 |
11 | 4841a0375 |
12 | 245a0a62a |
13 | 1336164ca |
14 | 997c5106 |
15 | 5e927997 |
hex | 3cd70f02 |
1020727042 has 4 divisors (see below), whose sum is σ = 1531090566. Its totient is φ = 510363520.
The previous prime is 1020727031. The next prime is 1020727061. The reversal of 1020727042 is 2407270201.
1020727042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2407270201 = 7 ⋅343895743.
It can be written as a sum of positive squares in only one way, i.e., 611028961 + 409698081 = 24719^2 + 20241^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1020726998 and 1020727016.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 255181759 + ... + 255181762.
Almost surely, 21020727042 is an apocalyptic number.
1020727042 is a deficient number, since it is larger than the sum of its proper divisors (510363524).
1020727042 is an equidigital number, since it uses as much as digits as its factorization.
1020727042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510363523.
The product of its (nonzero) digits is 1568, while the sum is 25.
The square root of 1020727042 is about 31948.8191018072. The cubic root of 1020727042 is about 1006.8618217075.
Adding to 1020727042 its reverse (2407270201), we get a palindrome (3427997243).
It can be divided in two parts, 10207 and 27042, that added together give a square (37249 = 1932).
The spelling of 1020727042 in words is "one billion, twenty million, seven hundred twenty-seven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •