Base | Representation |
---|---|
bin | 1100000101110… |
… | …00000101001101 |
3 | 21001211112101001 |
4 | 12002320011031 |
5 | 201430323133 |
6 | 14021420301 |
7 | 2341014145 |
oct | 602700515 |
9 | 231745331 |
10 | 101417293 |
11 | 5227a34a |
12 | 29b6a691 |
13 | 1801b943 |
14 | d67d925 |
15 | 8d8487d |
hex | 60b814d |
101417293 has 4 divisors (see below), whose sum is σ = 101553088. Its totient is φ = 101281500.
The previous prime is 101417287. The next prime is 101417299. The reversal of 101417293 is 392714101.
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 an interprime number because it is at equal distance from previous prime (101417287) and next prime (101417299).
It is a cyclic number.
It is not a de Polignac number, because 101417293 - 213 = 101409101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101417299) 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 3 ways as a sum of consecutive naturals, for example, 66771 + ... + 68272.
It is an arithmetic number, because the mean of its divisors is an integer number (25388272).
Almost surely, 2101417293 is an apocalyptic number.
It is an amenable number.
101417293 is a deficient number, since it is larger than the sum of its proper divisors (135795).
101417293 is an equidigital number, since it uses as much as digits as its factorization.
101417293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135794.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 101417293 is about 10070.6153238022. The cubic root of 101417293 is about 466.3414350119.
The spelling of 101417293 in words is "one hundred one million, four hundred seventeen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •