Base | Representation |
---|---|
bin | 1010111100011011100100… |
… | …1111110101101010011101 |
3 | 1120121101002011020011010022 |
4 | 2233012321033311222131 |
5 | 3034123210200124041 |
6 | 41332005451321525 |
7 | 2351243446454336 |
oct | 257067117655235 |
9 | 46541064204108 |
10 | 12033311333021 |
11 | 391a3315a33a0 |
12 | 14241777502a5 |
13 | 693975b04524 |
14 | 2d85b5b1328d |
15 | 15d0325da24b |
hex | af1b93f5a9d |
12033311333021 has 16 divisors (see below), whose sum is σ = 13401209877120. Its totient is φ = 10711884006720.
The previous prime is 12033311332993. The next prime is 12033311333063.
12033311333021 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 12033311333021 - 210 = 12033311331997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12033311330021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19978625 + ... + 20572118.
It is an arithmetic number, because the mean of its divisors is an integer number (837575617320).
Almost surely, 212033311333021 is an apocalyptic number.
12033311333021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12033311333021 is a deficient number, since it is larger than the sum of its proper divisors (1367898544099).
12033311333021 is a wasteful number, since it uses less digits than its factorization.
12033311333021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40551316.
The product of its (nonzero) digits is 2916, while the sum is 26.
It can be divided in two parts, 1203331 and 1333021, that added together give a palindrome (2536352).
The spelling of 12033311333021 in words is "twelve trillion, thirty-three billion, three hundred eleven million, three hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •