Base | Representation |
---|---|
bin | 111100110100100… |
… | …111001110010011 |
3 | 2122010002222002111 |
4 | 330310213032103 |
5 | 4042212100412 |
6 | 245131130151 |
7 | 34200320212 |
oct | 7464471623 |
9 | 2563088074 |
10 | 1020425107 |
11 | 484004539 |
12 | 2458a3957 |
13 | 13353bc50 |
14 | 99747079 |
15 | 5e8b82a7 |
hex | 3cd27393 |
1020425107 has 8 divisors (see below), whose sum is σ = 1146698784. Its totient is φ = 900977088.
The previous prime is 1020425099. The next prime is 1020425123. The reversal of 1020425107 is 7015240201.
It is a happy number.
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 1020425107 - 23 = 1020425099 is a prime.
It is a super-2 number, since 2×10204251072 = 2082534797991922898, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020425137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1706098 + ... + 1706695.
It is an arithmetic number, because the mean of its divisors is an integer number (143337348).
Almost surely, 21020425107 is an apocalyptic number.
1020425107 is a deficient number, since it is larger than the sum of its proper divisors (126273677).
1020425107 is a wasteful number, since it uses less digits than its factorization.
1020425107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3412829.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 1020425107 is about 31944.0934602940. The cubic root of 1020425107 is about 1006.7625340455.
Adding to 1020425107 its reverse (7015240201), we get a palindrome (8035665308).
The spelling of 1020425107 in words is "one billion, twenty million, four hundred twenty-five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •