Base | Representation |
---|---|
bin | 111101010011010… |
… | …000101011011011 |
3 | 2122200020010211111 |
4 | 331103100223123 |
5 | 4101241143402 |
6 | 250015241151 |
7 | 34325521255 |
oct | 7523205333 |
9 | 2580203744 |
10 | 1028459227 |
11 | 4885a1704 |
12 | 2485191b7 |
13 | 1350c2a73 |
14 | 9a838cd5 |
15 | 604539d7 |
hex | 3d4d0adb |
1028459227 has 4 divisors (see below), whose sum is σ = 1082588680. Its totient is φ = 974329776.
The previous prime is 1028459221. The next prime is 1028459231. The reversal of 1028459227 is 7229548201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7229548201 = 2819 ⋅2564579.
It is a cyclic number.
It is not a de Polignac number, because 1028459227 - 211 = 1028457179 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 1028459227.
It is not an unprimeable number, because it can be changed into a prime (1028459221) 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, 27064698 + ... + 27064735.
It is an arithmetic number, because the mean of its divisors is an integer number (270647170).
Almost surely, 21028459227 is an apocalyptic number.
1028459227 is a deficient number, since it is larger than the sum of its proper divisors (54129453).
1028459227 is an equidigital number, since it uses as much as digits as its factorization.
1028459227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54129452.
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 1028459227 is about 32069.5997324569. The cubic root of 1028459227 is about 1009.3978134345.
The spelling of 1028459227 in words is "one billion, twenty-eight million, four hundred fifty-nine thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •