Base | Representation |
---|---|
bin | 1011001000000011100101… |
… | …1111000100000010011000 |
3 | 1121022110120222120212002022 |
4 | 2302000321133010002120 |
5 | 3100411222003201240 |
6 | 42003435455354012 |
7 | 2401543630265252 |
oct | 262007137040230 |
9 | 47273528525068 |
10 | 12233031303320 |
11 | 3996aaa290093 |
12 | 1456a15522908 |
13 | 6a97540c8649 |
14 | 30412093ccd2 |
15 | 1633211979b5 |
hex | b20397c4098 |
12233031303320 has 64 divisors (see below), whose sum is σ = 27579457432800. Its totient is φ = 4883414625280.
The previous prime is 12233031303287. The next prime is 12233031303431. The reversal of 12233031303320 is 2330313033221.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 12233031303320.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 95778542 + ... + 95906178.
Almost surely, 212233031303320 is an apocalyptic number.
12233031303320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12233031303320 is an abundant number, since it is smaller than the sum of its proper divisors (15346426129480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12233031303320 is a wasteful number, since it uses less digits than its factorization.
12233031303320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132428 (or 132424 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 12233031303320 its reverse (2330313033221), we get a palindrome (14563344336541).
The spelling of 12233031303320 in words is "twelve trillion, two hundred thirty-three billion, thirty-one million, three hundred three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •