Base | Representation |
---|---|
bin | 11001100010000… |
… | …001000100110101 |
3 | 1002212000022120200 |
4 | 121202001010311 |
5 | 1334124111301 |
6 | 110300551113 |
7 | 13420616055 |
oct | 3142010465 |
9 | 1085008520 |
10 | 428347701 |
11 | 1aa877a71 |
12 | bb552499 |
13 | 6a9884a2 |
14 | 40c63565 |
15 | 27912c86 |
hex | 19881135 |
428347701 has 6 divisors (see below), whose sum is σ = 618724470. Its totient is φ = 285565128.
The previous prime is 428347697. The next prime is 428347727. The reversal of 428347701 is 107743824.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 407636100 + 20711601 = 20190^2 + 4551^2 .
It is not a de Polignac number, because 428347701 - 22 = 428347697 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428347741) 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, 23797086 + ... + 23797103.
It is an arithmetic number, because the mean of its divisors is an integer number (103120745).
Almost surely, 2428347701 is an apocalyptic number.
It is an amenable number.
428347701 is a deficient number, since it is larger than the sum of its proper divisors (190376769).
428347701 is a wasteful number, since it uses less digits than its factorization.
428347701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47594195 (or 47594192 counting only the distinct ones).
The product of its (nonzero) digits is 37632, while the sum is 36.
The square root of 428347701 is about 20696.5625406733. The cubic root of 428347701 is about 753.8162236478.
It can be divided in two parts, 4283 and 47701, that added together give a square (51984 = 2282).
The spelling of 428347701 in words is "four hundred twenty-eight million, three hundred forty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •