Base | Representation |
---|---|
bin | 10011011000101111010… |
… | …010000101100010110100 |
3 | 11201100201121200020002201 |
4 | 103120233102011202310 |
5 | 133311403140212322 |
6 | 2500004111314244 |
7 | 165151656531643 |
oct | 23305722054264 |
9 | 4640647606081 |
10 | 1332233132212 |
11 | 473aa6965534 |
12 | 19624221b984 |
13 | 98824021738 |
14 | 486a241735a |
15 | 249c3b12d27 |
hex | 1362f4858b4 |
1332233132212 has 12 divisors (see below), whose sum is σ = 2468549627460. Its totient is φ = 626933238656.
The previous prime is 1332233132183. The next prime is 1332233132213. The reversal of 1332233132212 is 2122313322331.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1213183290916 + 119049841296 = 1101446^2 + 345036^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332233132213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9795831787 + ... + 9795831922.
It is an arithmetic number, because the mean of its divisors is an integer number (205712468955).
Almost surely, 21332233132212 is an apocalyptic number.
It is an amenable number.
1332233132212 is a deficient number, since it is larger than the sum of its proper divisors (1136316495248).
1332233132212 is a wasteful number, since it uses less digits than its factorization.
1332233132212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19591663730 (or 19591663728 counting only the distinct ones).
The product of its digits is 7776, while the sum is 28.
Adding to 1332233132212 its reverse (2122313322331), we get a palindrome (3454546454543).
The spelling of 1332233132212 in words is "one trillion, three hundred thirty-two billion, two hundred thirty-three million, one hundred thirty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •