Base | Representation |
---|---|
bin | 1110101100010110010… |
… | …1110000011110100100 |
3 | 220010112210121201201211 |
4 | 3223011211300132210 |
5 | 13113430304100422 |
6 | 311543411201204 |
7 | 24144165025006 |
oct | 3530545603644 |
9 | 803483551654 |
10 | 252423112612 |
11 | 980632a2660 |
12 | 40b07ba6204 |
13 | 1aa5a0aa938 |
14 | c30856a376 |
15 | 6875908577 |
hex | 3ac59707a4 |
252423112612 has 48 divisors (see below), whose sum is σ = 497517318144. Its totient is φ = 111020148000.
The previous prime is 252423112541. The next prime is 252423112631. The reversal of 252423112612 is 216211324252.
It is a happy number.
252423112612 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an unprimeable number.
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, 16719187 + ... + 16734277.
It is an arithmetic number, because the mean of its divisors is an integer number (10364944128).
Almost surely, 2252423112612 is an apocalyptic number.
252423112612 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
252423112612 is a deficient number, since it is larger than the sum of its proper divisors (245094205532).
252423112612 is a wasteful number, since it uses less digits than its factorization.
252423112612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27400 (or 27398 counting only the distinct ones).
The product of its digits is 11520, while the sum is 31.
Adding to 252423112612 its reverse (216211324252), we get a palindrome (468634436864).
The spelling of 252423112612 in words is "two hundred fifty-two billion, four hundred twenty-three million, one hundred twelve thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •