Base | Representation |
---|---|
bin | 101010100011110… |
… | …0101100001000000 |
3 | 10200112010120010000 |
4 | 1111013211201000 |
5 | 10411040131112 |
6 | 353412040000 |
7 | 50250146001 |
oct | 12507454100 |
9 | 3615116100 |
10 | 1428052032 |
11 | 6731096a0 |
12 | 33a303000 |
13 | 199b20c04 |
14 | d79351a8 |
15 | 855867dc |
hex | 551e5840 |
1428052032 has 280 divisors, whose sum is σ = 4691237760. Its totient is φ = 425917440.
The previous prime is 1428052019. The next prime is 1428052057. The reversal of 1428052032 is 2302508241.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1428051987 and 1428052005.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4504738 + ... + 4505054.
Almost surely, 21428052032 is an apocalyptic number.
1428052032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1428052032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2345618880).
1428052032 is an abundant number, since it is smaller than the sum of its proper divisors (3263185728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1428052032 is a wasteful number, since it uses less digits than its factorization.
1428052032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431 (or 412 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 1428052032 is about 37789.5757054773. The cubic root of 1428052032 is about 1126.1113710646. Note that the first 3 decimals are identical.
The spelling of 1428052032 in words is "one billion, four hundred twenty-eight million, fifty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •