Base | Representation |
---|---|
bin | 101010101100100… |
… | …0101111001100000 |
3 | 10200211202201011020 |
4 | 1111121011321200 |
5 | 10413224003440 |
6 | 354054245440 |
7 | 50334151161 |
oct | 12531057140 |
9 | 3624681136 |
10 | 1432641120 |
11 | 675763529 |
12 | 33b956880 |
13 | 19aa69951 |
14 | d83ab768 |
15 | 85b913d0 |
hex | 55645e60 |
1432641120 has 192 divisors, whose sum is σ = 4638078144. Its totient is φ = 371589120.
The previous prime is 1432641113. The next prime is 1432641131. The reversal of 1432641120 is 211462341.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3308424 + ... + 3308856.
It is an arithmetic number, because the mean of its divisors is an integer number (24156657).
Almost surely, 21432641120 is an apocalyptic number.
1432641120 is a gapful number since it is divisible by the number (10) 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 1432641120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2319039072).
1432641120 is an abundant number, since it is smaller than the sum of its proper divisors (3205437024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1432641120 is a wasteful number, since it uses less digits than its factorization.
1432641120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 625 (or 617 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 1432641120 is about 37850.2459701387. The cubic root of 1432641120 is about 1127.3163454569.
The spelling of 1432641120 in words is "one billion, four hundred thirty-two million, six hundred forty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •