Base | Representation |
---|---|
bin | 1110101101000110000… |
… | …1001011101111000100 |
3 | 220011001202012021002012 |
4 | 3223101201023233010 |
5 | 13114333022141012 |
6 | 312015320433352 |
7 | 24152145053114 |
oct | 3532141135704 |
9 | 804052167065 |
10 | 252623240132 |
11 | 981562623aa |
12 | 40b63018858 |
13 | 1aa8c6aaca3 |
14 | c326d83044 |
15 | 688828a622 |
hex | 3ad184bbc4 |
252623240132 has 48 divisors (see below), whose sum is σ = 478235052288. Its totient is φ = 116308431360.
The previous prime is 252623240131. The next prime is 252623240153. The reversal of 252623240132 is 231042326252.
252623240132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×2526232401323 (a number of 35 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (252623240131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9437207 + ... + 9463937.
It is an arithmetic number, because the mean of its divisors is an integer number (9963230256).
Almost surely, 2252623240132 is an apocalyptic number.
It is an amenable number.
252623240132 is a deficient number, since it is larger than the sum of its proper divisors (225611812156).
252623240132 is a wasteful number, since it uses less digits than its factorization.
252623240132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29756 (or 29754 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 252623240132 its reverse (231042326252), we get a palindrome (483665566384).
The spelling of 252623240132 in words is "two hundred fifty-two billion, six hundred twenty-three million, two hundred forty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •