Base | Representation |
---|---|
bin | 100100100001101… |
… | …111100101011000 |
3 | 1120201010202110020 |
4 | 210201233211120 |
5 | 2223340403212 |
6 | 140450550440 |
7 | 21120634032 |
oct | 4441574530 |
9 | 1521122406 |
10 | 612825432 |
11 | 294a188aa |
12 | 151298420 |
13 | 99c694cb |
14 | 5b564c52 |
15 | 38c02d8c |
hex | 2486f958 |
612825432 has 64 divisors (see below), whose sum is σ = 1628916480. Its totient is φ = 191697792.
The previous prime is 612825407. The next prime is 612825457. The reversal of 612825432 is 234528216.
It is an interprime number because it is at equal distance from previous prime (612825407) and next prime (612825457).
It is a junction number, because it is equal to n+sod(n) for n = 612825393 and 612825402.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18783 + ... + 39729.
It is an arithmetic number, because the mean of its divisors is an integer number (25451820).
Almost surely, 2612825432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 612825432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (814458240).
612825432 is an abundant number, since it is smaller than the sum of its proper divisors (1016091048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
612825432 is a wasteful number, since it uses less digits than its factorization.
612825432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21032 (or 21028 counting only the distinct ones).
The product of its digits is 23040, while the sum is 33.
The square root of 612825432 is about 24755.3111877027. The cubic root of 612825432 is about 849.4000065680.
The spelling of 612825432 in words is "six hundred twelve million, eight hundred twenty-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •