Base | Representation |
---|---|
bin | 10001011111101001011… |
… | …011101000110100101011 |
3 | 11020221010020101010100122 |
4 | 101133221123220310223 |
5 | 124144112311241021 |
6 | 2320142203553455 |
7 | 152566640123516 |
oct | 21375133506453 |
9 | 4227106333318 |
10 | 1202212212011 |
11 | 4239454a7788 |
12 | 174bb652b88b |
13 | 894a2a039b5 |
14 | 4228a263d7d |
15 | 2141401abab |
hex | 117e96e8d2b |
1202212212011 has 4 divisors (see below), whose sum is σ = 1203167107800. Its totient is φ = 1201257316224.
The previous prime is 1202212211939. The next prime is 1202212212037. The reversal of 1202212212011 is 1102122122021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1202212212011 - 234 = 1185032342827 is a prime.
It is a super-2 number, since 2×12022122120112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1202212202011) 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 3 ways as a sum of consecutive naturals, for example, 477446006 + ... + 477448523.
It is an arithmetic number, because the mean of its divisors is an integer number (300791776950).
Almost surely, 21202212212011 is an apocalyptic number.
1202212212011 is a deficient number, since it is larger than the sum of its proper divisors (954895789).
1202212212011 is an equidigital number, since it uses as much as digits as its factorization.
1202212212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954895788.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1202212212011 its reverse (1102122122021), we get a palindrome (2304334334032).
The spelling of 1202212212011 in words is "one trillion, two hundred two billion, two hundred twelve million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •