Base | Representation |
---|---|
bin | 1010000101100… |
… | …0011111000001 |
3 | 2221121100012101 |
4 | 2201120133001 |
5 | 41312233343 |
6 | 4110430401 |
7 | 1022406400 |
oct | 241303701 |
9 | 87540171 |
10 | 42305473 |
11 | 21975801 |
12 | 12202401 |
13 | 89c3032 |
14 | 5893637 |
15 | 3aa9e4d |
hex | 28587c1 |
42305473 has 6 divisors (see below), whose sum is σ = 49212546. Its totient is φ = 36261792.
The previous prime is 42305449. The next prime is 42305477. The reversal of 42305473 is 37450324.
It can be written as a sum of positive squares in only one way, i.e., 28227969 + 14077504 = 5313^2 + 3752^2 .
It is not a de Polignac number, because 42305473 - 217 = 42174401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42305477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 431640 + ... + 431737.
It is an arithmetic number, because the mean of its divisors is an integer number (8202091).
Almost surely, 242305473 is an apocalyptic number.
It is an amenable number.
42305473 is a deficient number, since it is larger than the sum of its proper divisors (6907073).
42305473 is an equidigital number, since it uses as much as digits as its factorization.
42305473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863391 (or 863384 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 28.
The square root of 42305473 is about 6504.2657541032. The cubic root of 42305473 is about 348.4433536510.
Adding to 42305473 its reverse (37450324), we get a palindrome (79755797).
It can be divided in two parts, 42305 and 473, that added together give a triangular number (42778 = T292).
The spelling of 42305473 in words is "forty-two million, three hundred five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •