Base | Representation |
---|---|
bin | 101010100011111… |
… | …1101100011111111 |
3 | 10200112022120012222 |
4 | 1111013331203333 |
5 | 10411101304102 |
6 | 353414115555 |
7 | 50251036106 |
oct | 12507754377 |
9 | 3615276188 |
10 | 1428150527 |
11 | 6731766a1 |
12 | 33a34bbbb |
13 | 199b569ab |
14 | d795d03d |
15 | 855a5aa2 |
hex | 551fd8ff |
1428150527 has 4 divisors (see below), whose sum is σ = 1428256440. Its totient is φ = 1428044616.
The previous prime is 1428150509. The next prime is 1428150551. The reversal of 1428150527 is 7250518241.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1428150527 - 212 = 1428146431 is a prime.
It is a super-2 number, since 2×14281505272 = 4079227855540755458, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1428150557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29168 + ... + 60885.
It is an arithmetic number, because the mean of its divisors is an integer number (357064110).
Almost surely, 21428150527 is an apocalyptic number.
1428150527 is a deficient number, since it is larger than the sum of its proper divisors (105913).
1428150527 is an equidigital number, since it uses as much as digits as its factorization.
1428150527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105912.
The product of its (nonzero) digits is 22400, while the sum is 35.
The square root of 1428150527 is about 37790.8788863133. The cubic root of 1428150527 is about 1126.1372603616.
Adding to 1428150527 its reverse (7250518241), we get a palindrome (8678668768).
The spelling of 1428150527 in words is "one billion, four hundred twenty-eight million, one hundred fifty thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •