Base | Representation |
---|---|
bin | 11010011000110… |
… | …011000111110111 |
3 | 1010212000220212001 |
4 | 122120303013313 |
5 | 1401313132341 |
6 | 111532440131 |
7 | 13653650152 |
oct | 3230630767 |
9 | 1125026761 |
10 | 442708471 |
11 | 207996477 |
12 | 104319047 |
13 | 70945b9a |
14 | 42b20c99 |
15 | 28cecd31 |
hex | 1a6331f7 |
442708471 has 4 divisors (see below), whose sum is σ = 448042392. Its totient is φ = 437374552.
The previous prime is 442708451. The next prime is 442708477. The reversal of 442708471 is 174807244.
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 442708471 - 29 = 442707959 is a prime.
It is a super-3 number, since 3×4427084713 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 442708471.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (442708477) 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, 2666836 + ... + 2667001.
It is an arithmetic number, because the mean of its divisors is an integer number (112010598).
Almost surely, 2442708471 is an apocalyptic number.
442708471 is a deficient number, since it is larger than the sum of its proper divisors (5333921).
442708471 is an equidigital number, since it uses as much as digits as its factorization.
442708471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5333920.
The product of its (nonzero) digits is 50176, while the sum is 37.
The square root of 442708471 is about 21040.6385597016. The cubic root of 442708471 is about 762.1479351479.
The spelling of 442708471 in words is "four hundred forty-two million, seven hundred eight thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •