Base | Representation |
---|---|
bin | 10011001010001… |
… | …000111011101000 |
3 | 211101211002101101 |
4 | 103022020323220 |
5 | 1124241101003 |
6 | 51521131144 |
7 | 10652032333 |
oct | 2312107350 |
9 | 741732341 |
10 | 321425128 |
11 | 155488502 |
12 | 8b789ab4 |
13 | 5178caab |
14 | 3098d61a |
15 | 1d34211d |
hex | 13288ee8 |
321425128 has 32 divisors (see below), whose sum is σ = 635407200. Its totient is φ = 152010432.
The previous prime is 321425107. The next prime is 321425149. The reversal of 321425128 is 821524123.
It is an interprime number because it is at equal distance from previous prime (321425107) and next prime (321425149).
It is a super-2 number, since 2×3214251282 = 206628225819632768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321425096 and 321425105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 124426 + ... + 126982.
It is an arithmetic number, because the mean of its divisors is an integer number (19856475).
Almost surely, 2321425128 is an apocalyptic number.
321425128 is a gapful number since it is divisible by the number (38) formed by its first and last digit.
It is an amenable number.
321425128 is a deficient number, since it is larger than the sum of its proper divisors (313982072).
321425128 is a wasteful number, since it uses less digits than its factorization.
321425128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3409 (or 3405 counting only the distinct ones).
The product of its digits is 3840, while the sum is 28.
The square root of 321425128 is about 17928.3331071240. Note that the first 3 decimals coincide. The cubic root of 321425128 is about 685.0042644521.
The spelling of 321425128 in words is "three hundred twenty-one million, four hundred twenty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •