Base | Representation |
---|---|
bin | 11001011110010… |
… | …011110111011101 |
3 | 1002210011221210012 |
4 | 121132103313131 |
5 | 1333402013333 |
6 | 110224053005 |
7 | 13406431304 |
oct | 3136236735 |
9 | 1083157705 |
10 | 427376093 |
11 | 1aa273a91 |
12 | bb164165 |
13 | 6a708181 |
14 | 40a8d43b |
15 | 277bee48 |
hex | 19793ddd |
427376093 has 6 divisors (see below), whose sum is σ = 428560314. Its totient is φ = 426194144.
The previous prime is 427376077. The next prime is 427376099. The reversal of 427376093 is 390673724.
It can be written as a sum of positive squares in 3 ways, for example, as 170511364 + 256864729 = 13058^2 + 16027^2 .
It is not a de Polignac number, because 427376093 - 24 = 427376077 is a prime.
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 427376093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427376099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 527873 + ... + 528681.
It is an arithmetic number, because the mean of its divisors is an integer number (71426719).
Almost surely, 2427376093 is an apocalyptic number.
It is an amenable number.
427376093 is a deficient number, since it is larger than the sum of its proper divisors (1184221).
427376093 is an frugal number, since it uses more digits than its factorization.
427376093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2271 (or 1462 counting only the distinct ones).
The product of its (nonzero) digits is 190512, while the sum is 41.
The square root of 427376093 is about 20673.0765247943. The cubic root of 427376093 is about 753.2458394005.
The spelling of 427376093 in words is "four hundred twenty-seven million, three hundred seventy-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •