Base | Representation |
---|---|
bin | 101111000011010000010… |
… | …111011110010100010011 |
3 | 102110002202000111022121212 |
4 | 233003100113132110103 |
5 | 410433310133033021 |
6 | 10513210200410335 |
7 | 452412315625364 |
oct | 57032027362423 |
9 | 12402660438555 |
10 | 3233311221011 |
11 | 103726a98a2a3 |
12 | 4427794769ab |
13 | 1a5b91224a31 |
14 | b26c90bdb6b |
15 | 5918c35e85b |
hex | 2f0d05de513 |
3233311221011 has 8 divisors (see below), whose sum is σ = 3281881983120. Its totient is φ = 3184749646848.
The previous prime is 3233311220983. The next prime is 3233311221031. The reversal of 3233311221011 is 1101221133323.
3233311221011 is digitally balanced in base 2 and base 3, because in such bases 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 3233311221011 - 234 = 3216131351827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3233311221031) 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, 1586246 + ... + 2997131.
It is an arithmetic number, because the mean of its divisors is an integer number (410235247890).
Almost surely, 23233311221011 is an apocalyptic number.
3233311221011 is a deficient number, since it is larger than the sum of its proper divisors (48570762109).
3233311221011 is a wasteful number, since it uses less digits than its factorization.
3233311221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4593973.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3233311221011 its reverse (1101221133323), we get a palindrome (4334532354334).
The spelling of 3233311221011 in words is "three trillion, two hundred thirty-three billion, three hundred eleven million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •