Base | Representation |
---|---|
bin | 1011001000000000111111… |
… | …1000001000100000000101 |
3 | 1121022101210100001011102220 |
4 | 2302000033320020200011 |
5 | 3100403304301412013 |
6 | 42003242321322553 |
7 | 2401520422626300 |
oct | 262001770104005 |
9 | 47271710034386 |
10 | 12232333232133 |
11 | 3996781238953 |
12 | 145685b796459 |
13 | 6a96725b3181 |
14 | 304095d47b37 |
15 | 1632cec56b23 |
hex | b200fe08805 |
12232333232133 has 12 divisors (see below), whose sum is σ = 18972598482720. Its totient is φ = 6989904703992.
The previous prime is 12232333232099. The next prime is 12232333232173. The reversal of 12232333232133 is 33123233323221.
It is not a de Polignac number, because 12232333232133 - 216 = 12232333166597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12232333232094 and 12232333232103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12232333232173) 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, 41606575473 + ... + 41606575766.
It is an arithmetic number, because the mean of its divisors is an integer number (1581049873560).
Almost surely, 212232333232133 is an apocalyptic number.
It is an amenable number.
12232333232133 is a deficient number, since it is larger than the sum of its proper divisors (6740265250587).
12232333232133 is an equidigital number, since it uses as much as digits as its factorization.
12232333232133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83213151256 (or 83213151249 counting only the distinct ones).
The product of its digits is 69984, while the sum is 33.
Adding to 12232333232133 its reverse (33123233323221), we get a palindrome (45355566555354).
The spelling of 12232333232133 in words is "twelve trillion, two hundred thirty-two billion, three hundred thirty-three million, two hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •