Base | Representation |
---|---|
bin | 100111000001… |
… | …111010011101 |
3 | 201020210220201 |
4 | 213001322131 |
5 | 10104401303 |
6 | 1003143501 |
7 | 152652211 |
oct | 47017235 |
9 | 21223821 |
10 | 10231453 |
11 | 5859051 |
12 | 3514b91 |
13 | 217301b |
14 | 1504941 |
15 | d7181d |
hex | 9c1e9d |
10231453 has 2 divisors, whose sum is σ = 10231454. Its totient is φ = 10231452.
The previous prime is 10231439. The next prime is 10231471. The reversal of 10231453 is 35413201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10099684 + 131769 = 3178^2 + 363^2 .
It is an emirp because it is prime and its reverse (35413201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10231453 - 25 = 10231421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10231453.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10231153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115726 + 5115727.
It is an arithmetic number, because the mean of its divisors is an integer number (5115727).
Almost surely, 210231453 is an apocalyptic number.
It is an amenable number.
10231453 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231453 is an equidigital number, since it uses as much as digits as its factorization.
10231453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 10231453 is about 3198.6642524654. The cubic root of 10231453 is about 217.0929755121.
Adding to 10231453 its reverse (35413201), we get a palindrome (45644654).
The spelling of 10231453 in words is "ten million, two hundred thirty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •