Base | Representation |
---|---|
bin | 10110111110000111… |
… | …10011110001001000 |
3 | 1011211110022022201200 |
4 | 23133003303301020 |
5 | 200224024032412 |
6 | 5355414544200 |
7 | 614414262066 |
oct | 133703636110 |
9 | 34743268650 |
10 | 12332252232 |
11 | 52592646a3 |
12 | 2482068060 |
13 | 1216c45791 |
14 | 84dbc9036 |
15 | 4c2a009dc |
hex | 2df0f3c48 |
12332252232 has 48 divisors (see below), whose sum is σ = 33411007500. Its totient is φ = 4109377536.
The previous prime is 12332252227. The next prime is 12332252239. The reversal of 12332252232 is 23225223321.
It can be written as a sum of positive squares in 2 ways, for example, as 9435013956 + 2897238276 = 97134^2 + 53826^2 .
It is a super-2 number, since 2×123322522322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12332252196 and 12332252205.
It is not an unprimeable number, because it can be changed into a prime (12332252239) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 201144 + ... + 255192.
Almost surely, 212332252232 is an apocalyptic number.
12332252232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12332252232 is an abundant number, since it is smaller than the sum of its proper divisors (21078755268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12332252232 is a wasteful number, since it uses less digits than its factorization.
12332252232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57230 (or 57223 counting only the distinct ones).
The product of its digits is 8640, while the sum is 27.
Adding to 12332252232 its reverse (23225223321), we get a palindrome (35557475553).
The spelling of 12332252232 in words is "twelve billion, three hundred thirty-two million, two hundred fifty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •