Base | Representation |
---|---|
bin | 10110110010010100… |
… | …10101110101001000 |
3 | 1011120120010002121002 |
4 | 23121022111311020 |
5 | 200023211120240 |
6 | 5341522034132 |
7 | 612103226342 |
oct | 133112256510 |
9 | 34516102532 |
10 | 12233301320 |
11 | 520841a389 |
12 | 2454aa8948 |
13 | 11cc5ab646 |
14 | 8409cc292 |
15 | 4b8ea6d15 |
hex | 2d9295d48 |
12233301320 has 32 divisors (see below), whose sum is σ = 29144043000. Its totient is φ = 4605477888.
The previous prime is 12233301281. The next prime is 12233301389. The reversal of 12233301320 is 2310333221.
It can be written as a sum of positive squares in 4 ways, for example, as 10551809284 + 1681492036 = 102722^2 + 41006^2 .
It is a super-2 number, since 2×122333013202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 12233301292 and 12233301301.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8994395 + ... + 8995754.
Almost surely, 212233301320 is an apocalyptic number.
12233301320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12233301320 is an abundant number, since it is smaller than the sum of its proper divisors (16910741680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12233301320 is a wasteful number, since it uses less digits than its factorization.
12233301320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17990177 (or 17990173 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 12233301320 its reverse (2310333221), we get a palindrome (14543634541).
The spelling of 12233301320 in words is "twelve billion, two hundred thirty-three million, three hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •