Base | Representation |
---|---|
bin | 1011000110110001111100… |
… | …0000011001100101001001 |
3 | 1121020101000101222002210122 |
4 | 2301230133000121211021 |
5 | 3100031324212033001 |
6 | 41545412453353025 |
7 | 2400136513204211 |
oct | 261543700314511 |
9 | 47211011862718 |
10 | 12211112221001 |
11 | 3988781562121 |
12 | 1452718938775 |
13 | 6a766cc68655 |
14 | 303041823241 |
15 | 16298bbeeb1b |
hex | b1b1f019949 |
12211112221001 has 8 divisors (see below), whose sum is σ = 12215418043584. Its totient is φ = 12206807038800.
The previous prime is 12211112220953. The next prime is 12211112221013. The reversal of 12211112221001 is 10012221111221.
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 12211112221001 - 222 = 12211108026697 is a prime.
It is a super-2 number, since 2×122111122210012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12211112227001) 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, 39718196 + ... + 40024458.
It is an arithmetic number, because the mean of its divisors is an integer number (1526927255448).
Almost surely, 212211112221001 is an apocalyptic number.
It is an amenable number.
12211112221001 is a deficient number, since it is larger than the sum of its proper divisors (4305822583).
12211112221001 is an equidigital number, since it uses as much as digits as its factorization.
12211112221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320191.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12211112221001 its reverse (10012221111221), we get a palindrome (22223333332222).
The spelling of 12211112221001 in words is "twelve trillion, two hundred eleven billion, one hundred twelve million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •