Base | Representation |
---|---|
bin | 1010000100101… |
… | …0111100010111 |
3 | 2221111112010002 |
4 | 2201022330113 |
5 | 41304000012 |
6 | 4105321515 |
7 | 1022055602 |
oct | 241127427 |
9 | 87445102 |
10 | 42250007 |
11 | 21938068 |
12 | 1219629b |
13 | 89a3a07 |
14 | 587b339 |
15 | 3a987c2 |
hex | 284af17 |
42250007 has 4 divisors (see below), whose sum is σ = 42450456. Its totient is φ = 42049560.
The previous prime is 42249997. The next prime is 42250009. The reversal of 42250007 is 70005224.
42250007 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.
It is a cyclic number.
It is not a de Polignac number, because 42250007 - 28 = 42249751 is a prime.
It is a super-3 number, since 3×422500073 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42250009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99908 + ... + 100329.
It is an arithmetic number, because the mean of its divisors is an integer number (10612614).
Almost surely, 242250007 is an apocalyptic number.
42250007 is a deficient number, since it is larger than the sum of its proper divisors (200449).
42250007 is a wasteful number, since it uses less digits than its factorization.
42250007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200448.
The product of its (nonzero) digits is 560, while the sum is 20.
The square root of 42250007 is about 6500.0005384615. Note that the first 3 decimals coincide. The cubic root of 42250007 is about 348.2910076291.
The spelling of 42250007 in words is "forty-two million, two hundred fifty thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •