Base | Representation |
---|---|
bin | 1010000000110111100001… |
… | …1100110100011001011101 |
3 | 1102222112210100211001001210 |
4 | 2200031320130310121131 |
5 | 2420342011113001341 |
6 | 35225533445455033 |
7 | 2214306415605006 |
oct | 240157034643135 |
9 | 42875710731053 |
10 | 11010022000221 |
11 | 3565362430022 |
12 | 1299996111479 |
13 | 61b3188451ba |
14 | 2a0c605c41ad |
15 | 1415e1460c16 |
hex | a037873465d |
11010022000221 has 8 divisors (see below), whose sum is σ = 14680048086784. Its totient is φ = 7340005290240.
The previous prime is 11010022000207. The next prime is 11010022000231. The reversal of 11010022000221 is 12200022001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11010022000221 - 213 = 11010021992029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010022000197 and 11010022000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010022000231) 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, 1132116 + ... + 4827186.
It is an arithmetic number, because the mean of its divisors is an integer number (1835006010848).
Almost surely, 211010022000221 is an apocalyptic number.
It is an amenable number.
11010022000221 is a deficient number, since it is larger than the sum of its proper divisors (3670026086563).
11010022000221 is an equidigital number, since it uses as much as digits as its factorization.
11010022000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4688291.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11010022000221 its reverse (12200022001011), we get a palindrome (23210044001232).
The spelling of 11010022000221 in words is "eleven trillion, ten billion, twenty-two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •