Base | Representation |
---|---|
bin | 1100001101011… |
… | …10001101101101 |
3 | 21010201202022022 |
4 | 12012232031231 |
5 | 202210103303 |
6 | 14055155525 |
7 | 2352413324 |
oct | 606561555 |
9 | 233652268 |
10 | 102425453 |
11 | 528a8839 |
12 | 2a375ba5 |
13 | 182b27a0 |
14 | d8630bb |
15 | 8ed3438 |
hex | 61ae36d |
102425453 has 8 divisors (see below), whose sum is σ = 110394648. Its totient is φ = 94469184.
The previous prime is 102425423. The next prime is 102425471. The reversal of 102425453 is 354524201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 51529 + 102373924 = 227^2 + 10118^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102425453 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102425423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18875 + ... + 23687.
It is an arithmetic number, because the mean of its divisors is an integer number (13799331).
Almost surely, 2102425453 is an apocalyptic number.
102425453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102425453 is a deficient number, since it is larger than the sum of its proper divisors (7969195).
102425453 is a wasteful number, since it uses less digits than its factorization.
102425453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6463.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 102425453 is about 10120.5460821045. The cubic root of 102425453 is about 467.8815979359.
Adding to 102425453 its reverse (354524201), we get a palindrome (456949654).
The spelling of 102425453 in words is "one hundred two million, four hundred twenty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •