Base | Representation |
---|---|
bin | 10010001100001110110… |
… | …10101000101010000000 |
3 | 2012202100021002210220211 |
4 | 21012013122220222000 |
5 | 40220041243224402 |
6 | 1155050154443504 |
7 | 63105061510354 |
oct | 11060732505200 |
9 | 2182307083824 |
10 | 625042164352 |
11 | 2210960092a1 |
12 | a1179433594 |
13 | 46c30b37738 |
14 | 22376085464 |
15 | 113d35bd4d7 |
hex | 91876a8a80 |
625042164352 has 64 divisors (see below), whose sum is σ = 1269468252360. Its totient is φ = 306437713920.
The previous prime is 625042164269. The next prime is 625042164359. The reversal of 625042164352 is 253461240526.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 617003966016 + 8038198336 = 785496^2 + 89656^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (625042164359) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11458102 + ... + 11512522.
Almost surely, 2625042164352 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 625042164352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (634734126180).
625042164352 is an abundant number, since it is smaller than the sum of its proper divisors (644426088008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
625042164352 is a wasteful number, since it uses less digits than its factorization.
625042164352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56181 (or 56169 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 625042164352 in words is "six hundred twenty-five billion, forty-two million, one hundred sixty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •