Base | Representation |
---|---|
bin | 1010001011111111110011… |
… | …0111101111100110101010 |
3 | 1110122211022102202011111022 |
4 | 2202333330313233212222 |
5 | 2432010100341241020 |
6 | 35453434225532442 |
7 | 2234155504566545 |
oct | 242777467574652 |
9 | 43584272664438 |
10 | 11201222212010 |
11 | 3629458a18086 |
12 | 130aa567a4122 |
13 | 633369a138ac |
14 | 2aa1dbac985c |
15 | 1465820a5625 |
hex | a2ffcdef9aa |
11201222212010 has 8 divisors (see below), whose sum is σ = 20162199981636. Its totient is φ = 4480488884800.
The previous prime is 11201222211973. The next prime is 11201222212049. The reversal of 11201222212010 is 1021222210211.
It can be written as a sum of positive squares in 2 ways, for example, as 10683399491209 + 517822720801 = 3268547^2 + 719599^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11201222212010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560061110591 + ... + 560061110610.
Almost surely, 211201222212010 is an apocalyptic number.
11201222212010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11201222212010 is a deficient number, since it is larger than the sum of its proper divisors (8960977769626).
11201222212010 is a wasteful number, since it uses less digits than its factorization.
11201222212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120122221208.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11201222212010 its reverse (1021222210211), we get a palindrome (12222444422221).
The spelling of 11201222212010 in words is "eleven trillion, two hundred one billion, two hundred twenty-two million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •