Base | Representation |
---|---|
bin | 1100001100100… |
… | …10111101111111 |
3 | 21010112002020001 |
4 | 12012102331333 |
5 | 202143020410 |
6 | 14052535131 |
7 | 2351440060 |
oct | 606227577 |
9 | 233462201 |
10 | 102313855 |
11 | 52831a06 |
12 | 2a3214a7 |
13 | 18273a57 |
14 | d834567 |
15 | 8eb033a |
hex | 6192f7f |
102313855 has 8 divisors (see below), whose sum is σ = 140316192. Its totient is φ = 70158048.
The previous prime is 102313853. The next prime is 102313931. The reversal of 102313855 is 558313201.
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 102313855 - 21 = 102313853 is a prime.
It is a super-2 number, since 2×1023138552 = 20936249849922050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102313853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1461592 + ... + 1461661.
It is an arithmetic number, because the mean of its divisors is an integer number (17539524).
Almost surely, 2102313855 is an apocalyptic number.
102313855 is a deficient number, since it is larger than the sum of its proper divisors (38002337).
102313855 is an equidigital number, since it uses as much as digits as its factorization.
102313855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2923265.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 102313855 is about 10115.0311418206. The cubic root of 102313855 is about 467.7116088558.
It can be divided in two parts, 1023 and 13855, that added together give a triangular number (14878 = T172).
The spelling of 102313855 in words is "one hundred two million, three hundred thirteen thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •