Base | Representation |
---|---|
bin | 111001100010001001… |
… | …0100110110001110100 |
3 | 102210220120102221120220 |
4 | 1303010102212301310 |
5 | 4011013341433202 |
6 | 132431550254340 |
7 | 11632512121443 |
oct | 1630422466164 |
9 | 383816387526 |
10 | 123552296052 |
11 | 48442060789 |
12 | 1bb414b73b0 |
13 | b8601341b3 |
14 | 5da1038d5a |
15 | 3331c92abc |
hex | 1cc44a6c74 |
123552296052 has 24 divisors (see below), whose sum is σ = 288411904032. Its totient is φ = 41166496800.
The previous prime is 123552296051. The next prime is 123552296071. The reversal of 123552296052 is 250692255321.
It is a junction number, because it is equal to n+sod(n) for n = 123552295995 and 123552296013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123552296051) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2170974 + ... + 2227157.
It is an arithmetic number, because the mean of its divisors is an integer number (12017162668).
Almost surely, 2123552296052 is an apocalyptic number.
123552296052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
123552296052 is an abundant number, since it is smaller than the sum of its proper divisors (164859607980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123552296052 is a wasteful number, since it uses less digits than its factorization.
123552296052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4400479 (or 4400477 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 123552296052 in words is "one hundred twenty-three billion, five hundred fifty-two million, two hundred ninety-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •