Base | Representation |
---|---|
bin | 1010111010100111101110… |
… | …0001100110100100100101 |
3 | 1120111101210201112010120211 |
4 | 2232221323201212210211 |
5 | 3033121012011000313 |
6 | 41305423432055421 |
7 | 2346062656325005 |
oct | 256517341464445 |
9 | 46441721463524 |
10 | 12002211031333 |
11 | 3908122259426 |
12 | 141a138234571 |
13 | 690a5a7b4353 |
14 | 2d6ca54cc005 |
15 | 15c3120bae3d |
hex | aea7b866925 |
12002211031333 has 8 divisors (see below), whose sum is σ = 12012672742560. Its totient is φ = 11991750796560.
The previous prime is 12002211031247. The next prime is 12002211031337. The reversal of 12002211031333 is 33313011220021.
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 12002211031333 - 225 = 12002177476901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002211031337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16220391 + ... + 16944187.
It is an arithmetic number, because the mean of its divisors is an integer number (1501584092820).
Almost surely, 212002211031333 is an apocalyptic number.
It is an amenable number.
12002211031333 is a deficient number, since it is larger than the sum of its proper divisors (10461711227).
12002211031333 is a wasteful number, since it uses less digits than its factorization.
12002211031333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738227.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12002211031333 its reverse (33313011220021), we get a palindrome (45315222251354).
The spelling of 12002211031333 in words is "twelve trillion, two billion, two hundred eleven million, thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •