Base | Representation |
---|---|
bin | 1011111110001… |
… | …01110101110001 |
3 | 20222222010022011 |
4 | 11333011311301 |
5 | 201202100243 |
6 | 13544242521 |
7 | 2326412320 |
oct | 577056561 |
9 | 228863264 |
10 | 100425073 |
11 | 51761931 |
12 | 29770441 |
13 | 17a62128 |
14 | d4a20b7 |
15 | 8c3a89d |
hex | 5fc5d71 |
100425073 has 4 divisors (see below), whose sum is σ = 114771520. Its totient is φ = 86078628.
The previous prime is 100425071. The next prime is 100425077. The reversal of 100425073 is 370524001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 370524001 = 192492.
It is a cyclic number.
It is not a de Polignac number, because 100425073 - 21 = 100425071 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100425071) 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 3 ways as a sum of consecutive naturals, for example, 7173213 + ... + 7173226.
It is an arithmetic number, because the mean of its divisors is an integer number (28692880).
Almost surely, 2100425073 is an apocalyptic number.
It is an amenable number.
100425073 is a deficient number, since it is larger than the sum of its proper divisors (14346447).
100425073 is an equidigital number, since it uses as much as digits as its factorization.
100425073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14346446.
The product of its (nonzero) digits is 840, while the sum is 22.
The square root of 100425073 is about 10021.2311119942. The cubic root of 100425073 is about 464.8156250580.
Adding to 100425073 its reverse (370524001), we get a palindrome (470949074).
The spelling of 100425073 in words is "one hundred million, four hundred twenty-five thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.433 sec. • engine limits •