Base | Representation |
---|---|
bin | 101111111001011110… |
… | …1110010001101000101 |
3 | 100211111112020100101211 |
4 | 1133302331302031011 |
5 | 3141124243434001 |
6 | 115130430051421 |
7 | 10300660040401 |
oct | 1376275621505 |
9 | 324445210354 |
10 | 102860530501 |
11 | 3a6940a6aa3 |
12 | 17b27949b71 |
13 | 9913341241 |
14 | 4d9ad20101 |
15 | 2a2042e351 |
hex | 17f2f72345 |
102860530501 has 4 divisors (see below), whose sum is σ = 102862568512. Its totient is φ = 102858492492.
The previous prime is 102860530477. The next prime is 102860530529. The reversal of 102860530501 is 105035068201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102860530501 - 27 = 102860530373 is a prime.
It is a super-2 number, since 2×1028605305012 (a number of 23 digits) 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 (102860530541) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 941325 + ... + 1044898.
It is an arithmetic number, because the mean of its divisors is an integer number (25715642128).
Almost surely, 2102860530501 is an apocalyptic number.
It is an amenable number.
102860530501 is a deficient number, since it is larger than the sum of its proper divisors (2038011).
102860530501 is an equidigital number, since it uses as much as digits as its factorization.
102860530501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2038010.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 102860530501 its reverse (105035068201), we get a palindrome (207895598702).
The spelling of 102860530501 in words is "one hundred two billion, eight hundred sixty million, five hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •