Base | Representation |
---|---|
bin | 101010100011111… |
… | …0010101001100001 |
3 | 10200112020021220100 |
4 | 1111013302221201 |
5 | 10411043341300 |
6 | 353413133013 |
7 | 50250461556 |
oct | 12507625141 |
9 | 3615207810 |
10 | 1428105825 |
11 | 673146053 |
12 | 33a32a169 |
13 | 199b3c543 |
14 | d794aa2d |
15 | 85597700 |
hex | 551f2a61 |
1428105825 has 36 divisors (see below), whose sum is σ = 2708367948. Its totient is φ = 716851200.
The previous prime is 1428105823. The next prime is 1428105853. The reversal of 1428105825 is 5285018241.
It can be written as a sum of positive squares in 6 ways, for example, as 56070144 + 1372035681 = 7488^2 + 37041^2 .
It is not a de Polignac number, because 1428105825 - 21 = 1428105823 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1428105825.
It is not an unprimeable number, because it can be changed into a prime (1428105823) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 182856 + ... + 190505.
It is an arithmetic number, because the mean of its divisors is an integer number (75232443).
Almost surely, 21428105825 is an apocalyptic number.
1428105825 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1428105825 is a deficient number, since it is larger than the sum of its proper divisors (1280262123).
1428105825 is a wasteful number, since it uses less digits than its factorization.
1428105825 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373394 (or 373386 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 36.
The square root of 1428105825 is about 37790.2874426750. The cubic root of 1428105825 is about 1126.1255106400.
The spelling of 1428105825 in words is "one billion, four hundred twenty-eight million, one hundred five thousand, eight hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •