Base | Representation |
---|---|
bin | 1100001100100… |
… | …10010110010001 |
3 | 21010111221201220 |
4 | 12012102112101 |
5 | 202142430223 |
6 | 14052515253 |
7 | 2351426466 |
oct | 606222621 |
9 | 233457656 |
10 | 102311313 |
11 | 52830005 |
12 | 2a31bb29 |
13 | 18272850 |
14 | d83366d |
15 | 8eae6e3 |
hex | 6192591 |
102311313 has 8 divisors (see below), whose sum is σ = 146908608. Its totient is φ = 62960784.
The previous prime is 102311311. The next prime is 102311317. The reversal of 102311313 is 313113201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102311313 - 21 = 102311311 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102311292 and 102311301.
It is not an unprimeable number, because it can be changed into a prime (102311311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1311645 + ... + 1311722.
It is an arithmetic number, because the mean of its divisors is an integer number (18363576).
Almost surely, 2102311313 is an apocalyptic number.
102311313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102311313 is a deficient number, since it is larger than the sum of its proper divisors (44597295).
102311313 is a wasteful number, since it uses less digits than its factorization.
102311313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2623383.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 102311313 is about 10114.9054864591. The cubic root of 102311313 is about 467.7077353733.
Adding to 102311313 its reverse (313113201), we get a palindrome (415424514).
The spelling of 102311313 in words is "one hundred two million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •