Base | Representation |
---|---|
bin | 1100001101010… |
… | …11110000000001 |
3 | 21010201020110112 |
4 | 12012223300001 |
5 | 202204242421 |
6 | 14055041105 |
7 | 2352342026 |
oct | 606536001 |
9 | 233636415 |
10 | 102415361 |
11 | 528a11a4 |
12 | 2a370195 |
13 | 182ab009 |
14 | d85d54d |
15 | 8ed045b |
hex | 61abc01 |
102415361 has 4 divisors (see below), whose sum is σ = 108439812. Its totient is φ = 96390912.
The previous prime is 102415337. The next prime is 102415367. The reversal of 102415361 is 163514201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79995136 + 22420225 = 8944^2 + 4735^2 .
It is a cyclic number.
It is not a de Polignac number, because 102415361 - 210 = 102414337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102415367) 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, 3012200 + ... + 3012233.
It is an arithmetic number, because the mean of its divisors is an integer number (27109953).
Almost surely, 2102415361 is an apocalyptic number.
It is an amenable number.
102415361 is a deficient number, since it is larger than the sum of its proper divisors (6024451).
102415361 is an equidigital number, since it uses as much as digits as its factorization.
102415361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6024450.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 102415361 is about 10120.0474801258. The cubic root of 102415361 is about 467.8662306092.
Adding to 102415361 its reverse (163514201), we get a palindrome (265929562).
The spelling of 102415361 in words is "one hundred two million, four hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •