Base | Representation |
---|---|
bin | 1010000100010… |
… | …1011011010111 |
3 | 2221110101010100 |
4 | 2201011123113 |
5 | 41302234130 |
6 | 4105025143 |
7 | 1021632666 |
oct | 241053327 |
9 | 87411110 |
10 | 42227415 |
11 | 2192209a |
12 | 121851b3 |
13 | 8996649 |
14 | 5872ddd |
15 | 3a91c60 |
hex | 28456d7 |
42227415 has 12 divisors (see below), whose sum is σ = 73194264. Its totient is φ = 22521264.
The previous prime is 42227411. The next prime is 42227429. The reversal of 42227415 is 51472224.
42227415 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42227415 - 22 = 42227411 is a prime.
It is a nialpdrome in base 9.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42227411) 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 11 ways as a sum of consecutive naturals, for example, 469149 + ... + 469238.
It is an arithmetic number, because the mean of its divisors is an integer number (6099522).
Almost surely, 242227415 is an apocalyptic number.
42227415 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
42227415 is a deficient number, since it is larger than the sum of its proper divisors (30966849).
42227415 is a wasteful number, since it uses less digits than its factorization.
42227415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 938398 (or 938395 counting only the distinct ones).
The product of its digits is 4480, while the sum is 27.
The square root of 42227415 is about 6498.2624600735. The cubic root of 42227415 is about 348.2289169620.
Adding to 42227415 its reverse (51472224), we get a palindrome (93699639).
The spelling of 42227415 in words is "forty-two million, two hundred twenty-seven thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •