Base | Representation |
---|---|
bin | 1011001000000000111111… |
… | …0111101000111111111111 |
3 | 1121022101210022210121110000 |
4 | 2302000033313220333333 |
5 | 3100403304233244403 |
6 | 42003242314445343 |
7 | 2401520421551151 |
oct | 262001767507777 |
9 | 47271708717400 |
10 | 12232333103103 |
11 | 399678115aa13 |
12 | 145685b733853 |
13 | 6a9672569519 |
14 | 304095d12ad1 |
15 | 1632cec2d7a3 |
hex | b200fde8fff |
12232333103103 has 80 divisors (see below), whose sum is σ = 18831257026560. Its totient is φ = 7909048090944.
The previous prime is 12232333103059. The next prime is 12232333103117. The reversal of 12232333103103 is 30130133323221.
12232333103103 is a `hidden beast` number, since 1 + 2 + 2 + 3 + 2 + 33 + 310 + 310 + 3 = 666.
It is a de Polignac number, because none of the positive numbers 2k-12232333103103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12232333103143) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 415302325 + ... + 415331777.
It is an arithmetic number, because the mean of its divisors is an integer number (235390712832).
Almost surely, 212232333103103 is an apocalyptic number.
12232333103103 is a deficient number, since it is larger than the sum of its proper divisors (6598923923457).
12232333103103 is a wasteful number, since it uses less digits than its factorization.
12232333103103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30498 (or 30489 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 12232333103103 its reverse (30130133323221), we get a palindrome (42362466426324).
The spelling of 12232333103103 in words is "twelve trillion, two hundred thirty-two billion, three hundred thirty-three million, one hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •