Base | Representation |
---|---|
bin | 111100001110011… |
… | …101111010011101 |
3 | 2121102021221012201 |
4 | 330032131322131 |
5 | 4032132104001 |
6 | 244132531501 |
7 | 34016321641 |
oct | 7416357235 |
9 | 2542257181 |
10 | 1010425501 |
11 | 4793a46a8 |
12 | 242480b91 |
13 | 13144a617 |
14 | 982a2c21 |
15 | 5da90501 |
hex | 3c39de9d |
1010425501 has 8 divisors (see below), whose sum is σ = 1045873664. Its totient is φ = 975155760.
The previous prime is 1010425499. The next prime is 1010425519. The reversal of 1010425501 is 1055240101.
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 1010425501 - 21 = 1010425499 is a prime.
It is a super-2 number, since 2×10104255012 = 2041919386142202002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010425561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33030 + ... + 55783.
It is an arithmetic number, because the mean of its divisors is an integer number (130734208).
Almost surely, 21010425501 is an apocalyptic number.
It is an amenable number.
1010425501 is a deficient number, since it is larger than the sum of its proper divisors (35448163).
1010425501 is an equidigital number, since it uses as much as digits as its factorization.
1010425501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89211.
The product of its (nonzero) digits is 200, while the sum is 19.
The square root of 1010425501 is about 31787.1908321575. The cubic root of 1010425501 is about 1003.4631596799.
Adding to 1010425501 its reverse (1055240101), we get a palindrome (2065665602).
The spelling of 1010425501 in words is "one billion, ten million, four hundred twenty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •