Base | Representation |
---|---|
bin | 1011001000000100001110… |
… | …1111010010111111000011 |
3 | 1121022111000222021202201021 |
4 | 2302001003233102333003 |
5 | 3100412100023043021 |
6 | 42003504522450311 |
7 | 2401551116430565 |
oct | 262010357227703 |
9 | 47274028252637 |
10 | 12233203331011 |
11 | 39970883a8033 |
12 | 1456a63063997 |
13 | 6a978093a890 |
14 | 30413971d335 |
15 | 163331328c41 |
hex | b2043bd2fc3 |
12233203331011 has 8 divisors (see below), whose sum is σ = 13174387427264. Its totient is φ = 11292043299840.
The previous prime is 12233203330969. The next prime is 12233203331051. The reversal of 12233203331011 is 11013330233221.
12233203331011 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 a cyclic number.
It is not a de Polignac number, because 12233203331011 - 215 = 12233203298243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12233203331051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4953531 + ... + 7000276.
It is an arithmetic number, because the mean of its divisors is an integer number (1646798428408).
Almost surely, 212233203331011 is an apocalyptic number.
12233203331011 is a deficient number, since it is larger than the sum of its proper divisors (941184096253).
12233203331011 is a wasteful number, since it uses less digits than its factorization.
12233203331011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12032541.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12233203331011 its reverse (11013330233221), we get a palindrome (23246533564232).
The spelling of 12233203331011 in words is "twelve trillion, two hundred thirty-three billion, two hundred three million, three hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •