Base | Representation |
---|---|
bin | 10110110010010010… |
… | …10100011001110011 |
3 | 1011120112121110222120 |
4 | 23121021110121303 |
5 | 200023124031311 |
6 | 5341512205323 |
7 | 612101032131 |
oct | 133111243163 |
9 | 34515543876 |
10 | 12233033331 |
11 | 5208257002 |
12 | 2454999843 |
13 | 11cc51667c |
14 | 84095c751 |
15 | 4b8e52706 |
hex | 2d9254673 |
12233033331 has 8 divisors (see below), whose sum is σ = 16366380240. Its totient is φ = 8127520992.
The previous prime is 12233033291. The next prime is 12233033339. The reversal of 12233033331 is 13333033221.
12233033331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12233033331 - 210 = 12233032307 is a prime.
It is a super-2 number, since 2×122330333312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12233033339) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6957616 + ... + 6959373.
It is an arithmetic number, because the mean of its divisors is an integer number (2045797530).
Almost surely, 212233033331 is an apocalyptic number.
12233033331 is a deficient number, since it is larger than the sum of its proper divisors (4133346909).
12233033331 is a wasteful number, since it uses less digits than its factorization.
12233033331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13917285.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 12233033331 its reverse (13333033221), we get a palindrome (25566066552).
The spelling of 12233033331 in words is "twelve billion, two hundred thirty-three million, thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •