Base | Representation |
---|---|
bin | 1001101001100101100001… |
… | …00101101011100101100001 |
3 | 2210010121210022221210212221 |
4 | 10310302300211223211201 |
5 | 10240132231341010423 |
6 | 113044214015151041 |
7 | 4320046613236333 |
oct | 464626045534541 |
9 | 83117708853787 |
10 | 21220101110113 |
11 | 6841437962724 |
12 | 2468720b15481 |
13 | bac07c1b8229 |
14 | 5350b626b453 |
15 | 26beb4610e5d |
hex | 134cb096b961 |
21220101110113 has 8 divisors (see below), whose sum is σ = 21714756236096. Its totient is φ = 20725498911600.
The previous prime is 21220101110101. The next prime is 21220101110203. The reversal of 21220101110113 is 31101110102212.
It is a happy number.
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 21220101110113 - 221 = 21220099012961 is a prime.
It is a super-2 number, since 2×212201011101132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21220101810113) 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, 12420093 + ... + 14024938.
It is an arithmetic number, because the mean of its divisors is an integer number (2714344529512).
Almost surely, 221220101110113 is an apocalyptic number.
It is an amenable number.
21220101110113 is a deficient number, since it is larger than the sum of its proper divisors (494655125983).
21220101110113 is a wasteful number, since it uses less digits than its factorization.
21220101110113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26463735.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 21220101110113 its reverse (31101110102212), we get a palindrome (52321211212325).
The spelling of 21220101110113 in words is "twenty-one trillion, two hundred twenty billion, one hundred one million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •