Base | Representation |
---|---|
bin | 1001010010010111110000… |
… | …1001011011101100100001 |
3 | 1100011011221111010120212121 |
4 | 2110211330021123230201 |
5 | 2314300034322010423 |
6 | 33414545245024241 |
7 | 2102510360556511 |
oct | 224457411335441 |
9 | 40134844116777 |
10 | 10211220110113 |
11 | 3287610600aa0 |
12 | 118b004b55081 |
13 | 590bb5b7a8b9 |
14 | 274323419841 |
15 | 12a93d43445d |
hex | 9497c25bb21 |
10211220110113 has 8 divisors (see below), whose sum is σ = 11148621212736. Its totient is φ = 9275337068400.
The previous prime is 10211220110057. The next prime is 10211220110123. The reversal of 10211220110113 is 31101102211201.
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 a de Polignac number, because none of the positive numbers 2k-10211220110113 is a prime.
It is a super-2 number, since 2×102112201101132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211220110123) 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, 379501158 + ... + 379528063.
It is an arithmetic number, because the mean of its divisors is an integer number (1393577651592).
Almost surely, 210211220110113 is an apocalyptic number.
It is an amenable number.
10211220110113 is a deficient number, since it is larger than the sum of its proper divisors (937401102623).
10211220110113 is a wasteful number, since it uses less digits than its factorization.
10211220110113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 759030455.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10211220110113 its reverse (31101102211201), we get a palindrome (41312322321314).
The spelling of 10211220110113 in words is "ten trillion, two hundred eleven billion, two hundred twenty million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •