Base | Representation |
---|---|
bin | 100111000001… |
… | …101010110101 |
3 | 201020202112200 |
4 | 213001222311 |
5 | 10104333303 |
6 | 1003135113 |
7 | 152646252 |
oct | 47015265 |
9 | 21222480 |
10 | 10230453 |
11 | 5858322 |
12 | 3514499 |
13 | 217272c |
14 | 1504429 |
15 | d713a3 |
hex | 9c1ab5 |
10230453 has 6 divisors (see below), whose sum is σ = 14777334. Its totient is φ = 6820296.
The previous prime is 10230449. The next prime is 10230457. The reversal of 10230453 is 35403201.
10230453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10230449) and next prime (10230457).
It can be written as a sum of positive squares in only one way, i.e., 10227204 + 3249 = 3198^2 + 57^2 .
It is not a de Polignac number, because 10230453 - 22 = 10230449 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230457) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 568350 + ... + 568367.
It is an arithmetic number, because the mean of its divisors is an integer number (2462889).
Almost surely, 210230453 is an apocalyptic number.
It is an amenable number.
10230453 is a deficient number, since it is larger than the sum of its proper divisors (4546881).
10230453 is a wasteful number, since it uses less digits than its factorization.
10230453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1136723 (or 1136720 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 10230453 is about 3198.5079333964. The cubic root of 10230453 is about 217.0859025496.
Adding to 10230453 its reverse (35403201), we get a palindrome (45633654).
The spelling of 10230453 in words is "ten million, two hundred thirty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •