Base | Representation |
---|---|
bin | 1010111100011011100111… |
… | …1001010111111000101101 |
3 | 1120121101002220201022202112 |
4 | 2233012321321113320231 |
5 | 3034123220442033401 |
6 | 41332010520533405 |
7 | 2351243641143116 |
oct | 257067171277055 |
9 | 46541086638675 |
10 | 12033322221101 |
11 | 391a33775a805 |
12 | 142417b321265 |
13 | 69397814738c |
14 | 2d85b734920d |
15 | 15d03353b3bb |
hex | af1b9e57e2d |
12033322221101 has 4 divisors (see below), whose sum is σ = 12666654969600. Its totient is φ = 11399989472604.
The previous prime is 12033322221091. The next prime is 12033322221113. The reversal of 12033322221101 is 10112222333021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12033322221101 - 210 = 12033322220077 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 (12033322421101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 316666374221 + ... + 316666374258.
It is an arithmetic number, because the mean of its divisors is an integer number (3166663742400).
Almost surely, 212033322221101 is an apocalyptic number.
It is an amenable number.
12033322221101 is a deficient number, since it is larger than the sum of its proper divisors (633332748499).
12033322221101 is an equidigital number, since it uses as much as digits as its factorization.
12033322221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633332748498.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12033322221101 its reverse (10112222333021), we get a palindrome (22145544554122).
The spelling of 12033322221101 in words is "twelve trillion, thirty-three billion, three hundred twenty-two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •