Base | Representation |
---|---|
bin | 11001100000100… |
… | …000011101100001 |
3 | 1002211021012201221 |
4 | 121200200131201 |
5 | 1334023430334 |
6 | 110244255041 |
7 | 13414350244 |
oct | 3140403541 |
9 | 1084235657 |
10 | 427951969 |
11 | 1aa627715 |
12 | bb3a1481 |
13 | 6a87a323 |
14 | 40b9d25b |
15 | 278858b4 |
hex | 19820761 |
427951969 has 9 divisors (see below), whose sum is σ = 433972371. Its totient is φ = 422014800.
The previous prime is 427951963. The next prime is 427952009. The reversal of 427951969 is 969159724.
The square root of 427951969 is 20687.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 251381025 + 176570944 = 15855^2 + 13288^2 .
It is not a de Polignac number, because 427951969 - 27 = 427951841 is a prime.
It is a super-2 number, since 2×4279519692 = 366285775541953922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (427951963) 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 8 ways as a sum of consecutive naturals, for example, 2834044 + ... + 2834194.
Almost surely, 2427951969 is an apocalyptic number.
427951969 is the 20687-th square number.
427951969 is the 10344-th centered octagonal number.
It is an amenable number.
427951969 is a deficient number, since it is larger than the sum of its proper divisors (6020402).
427951969 is an frugal number, since it uses more digits than its factorization.
427951969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576 (or 288 counting only the distinct ones).
The product of its digits is 1224720, while the sum is 52.
The cubic root of 427951969 is about 753.5840126711.
The spelling of 427951969 in words is "four hundred twenty-seven million, nine hundred fifty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •