Base | Representation |
---|---|
bin | 10001110100000001100… |
… | …11000111101010110000 |
3 | 2011111210112222110210021 |
4 | 20322000303013222300 |
5 | 40011432314143212 |
6 | 1145100431013224 |
7 | 62135035130344 |
oct | 10720063075260 |
9 | 2144715873707 |
10 | 612046240432 |
11 | 216627168300 |
12 | 9a75106a214 |
13 | 4593c562123 |
14 | 218a209b624 |
15 | 10dc26c4307 |
hex | 8e80cc7ab0 |
612046240432 has 120 divisors (see below), whose sum is σ = 1318764374928. Its totient is φ = 274941173760.
The previous prime is 612046240411. The next prime is 612046240453. The reversal of 612046240432 is 234042640216.
It is an interprime number because it is at equal distance from previous prime (612046240411) and next prime (612046240453).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 160935843 + ... + 160939645.
Almost surely, 2612046240432 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 612046240432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (659382187464).
612046240432 is an abundant number, since it is smaller than the sum of its proper divisors (706718134496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
612046240432 is a wasteful number, since it uses less digits than its factorization.
612046240432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4787 (or 4770 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 612046240432 its reverse (234042640216), we get a palindrome (846088880648).
The spelling of 612046240432 in words is "six hundred twelve billion, forty-six million, two hundred forty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •