Base | Representation |
---|---|
bin | 1010001101001101010000… |
… | …0111100001111100110011 |
3 | 1110201210222101212221021102 |
4 | 2203103110013201330303 |
5 | 2432330140402233021 |
6 | 35511153255315015 |
7 | 2235522644236643 |
oct | 243232407417463 |
9 | 43653871787242 |
10 | 11222013321011 |
11 | 3637257a64a99 |
12 | 1312a9967ba6b |
13 | 63530127a55c |
14 | 2ab2110a4523 |
15 | 146d9c4de00b |
hex | a34d41e1f33 |
11222013321011 has 8 divisors (see below), whose sum is σ = 11494507961904. Its totient is φ = 10950042206880.
The previous prime is 11222013320983. The next prime is 11222013321059. The reversal of 11222013321011 is 11012331022211.
11222013321011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11222013321011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11222013381011) 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, 130838300 + ... + 130924041.
It is an arithmetic number, because the mean of its divisors is an integer number (1436813495238).
Almost surely, 211222013321011 is an apocalyptic number.
11222013321011 is a deficient number, since it is larger than the sum of its proper divisors (272494640893).
11222013321011 is an equidigital number, since it uses as much as digits as its factorization.
11222013321011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261763381.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11222013321011 its reverse (11012331022211), we get a palindrome (22234344343222).
The spelling of 11222013321011 in words is "eleven trillion, two hundred twenty-two billion, thirteen million, three hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •