Base | Representation |
---|---|
bin | 1110101101101010100… |
… | …0100010110101111100 |
3 | 220011110101221122012021 |
4 | 3223122220202311330 |
5 | 13120141144232412 |
6 | 312042422245524 |
7 | 24156012643330 |
oct | 3533250426574 |
9 | 804411848167 |
10 | 252776164732 |
11 | 98224611973 |
12 | 40ba62868a4 |
13 | 1aab5292110 |
14 | c33d3cd7c0 |
15 | 68968e6607 |
hex | 3adaa22d7c |
252776164732 has 96 divisors (see below), whose sum is σ = 560414332800. Its totient is φ = 97077657600.
The previous prime is 252776164727. The next prime is 252776164757. The reversal of 252776164732 is 237461677252.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a self number, because there is not a number n which added to its sum of digits gives 252776164732.
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, 6026232 + ... + 6068032.
It is an arithmetic number, because the mean of its divisors is an integer number (5837649300).
Almost surely, 2252776164732 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 252776164732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280207166400).
252776164732 is an abundant number, since it is smaller than the sum of its proper divisors (307638168068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252776164732 is a wasteful number, since it uses less digits than its factorization.
252776164732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42311 (or 42309 counting only the distinct ones).
The product of its digits is 5927040, while the sum is 52.
The spelling of 252776164732 in words is "two hundred fifty-two billion, seven hundred seventy-six million, one hundred sixty-four thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •