Base | Representation |
---|---|
bin | 1100001101001… |
… | …10100010010001 |
3 | 21010200011011102 |
4 | 12012212202101 |
5 | 202203102001 |
6 | 14054354145 |
7 | 2352222533 |
oct | 606464221 |
9 | 233604142 |
10 | 102394001 |
11 | 52887146 |
12 | 2a35b955 |
13 | 182a1388 |
14 | d855853 |
15 | 8ec8e6b |
hex | 61a6891 |
102394001 has 4 divisors (see below), whose sum is σ = 102622500. Its totient is φ = 102165504.
The previous prime is 102393989. The next prime is 102394013. The reversal of 102394001 is 100493201.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (102393989) and next prime (102394013).
It can be written as a sum of positive squares in 2 ways, for example, as 75603025 + 26790976 = 8695^2 + 5176^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102394001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102394601) 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, 113576 + ... + 114473.
It is an arithmetic number, because the mean of its divisors is an integer number (25655625).
Almost surely, 2102394001 is an apocalyptic number.
It is an amenable number.
102394001 is a deficient number, since it is larger than the sum of its proper divisors (228499).
102394001 is an equidigital number, since it uses as much as digits as its factorization.
102394001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228498.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 102394001 is about 10118.9920940774. The cubic root of 102394001 is about 467.8337019031.
The spelling of 102394001 in words is "one hundred two million, three hundred ninety-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •