Base | Representation |
---|---|
bin | 101111100110001000… |
… | …1001101111010100001 |
3 | 100202211021121200211210 |
4 | 1133030101031322201 |
5 | 3133312044011223 |
6 | 114542155100333 |
7 | 10245614554044 |
oct | 1371421157241 |
9 | 322737550753 |
10 | 102211313313 |
11 | 3a39069256a |
12 | 179864416a9 |
13 | 983b9a2665 |
14 | 4d38a04c5b |
15 | 29d343d893 |
hex | 17cc44dea1 |
102211313313 has 8 divisors (see below), whose sum is σ = 136283666400. Its totient is φ = 68139917888.
The previous prime is 102211313311. The next prime is 102211313387. The reversal of 102211313313 is 313313112201.
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 102211313313 - 21 = 102211313311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102211313313.
It is not an unprimeable number, because it can be changed into a prime (102211313311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64873 + ... + 456761.
It is an arithmetic number, because the mean of its divisors is an integer number (17035458300).
Almost surely, 2102211313313 is an apocalyptic number.
It is an amenable number.
102211313313 is a deficient number, since it is larger than the sum of its proper divisors (34072353087).
102211313313 is an equidigital number, since it uses as much as digits as its factorization.
102211313313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478831.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 102211313313 its reverse (313313112201), we get a palindrome (415524425514).
The spelling of 102211313313 in words is "one hundred two billion, two hundred eleven million, three hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •