Base | Representation |
---|---|
bin | 100111000001… |
… | …101010101111 |
3 | 201020202112110 |
4 | 213001222233 |
5 | 10104333242 |
6 | 1003135103 |
7 | 152646243 |
oct | 47015257 |
9 | 21222473 |
10 | 10230447 |
11 | 5858317 |
12 | 3514493 |
13 | 2172726 |
14 | 1504423 |
15 | d7139c |
hex | 9c1aaf |
10230447 has 8 divisors (see below), whose sum is σ = 14443056. Its totient is φ = 6419072.
The previous prime is 10230433. The next prime is 10230449. The reversal of 10230447 is 74403201.
10230447 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10230447 - 26 = 10230383 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230449) 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 in 7 ways as a sum of consecutive naturals, for example, 100248 + ... + 100349.
It is an arithmetic number, because the mean of its divisors is an integer number (1805382).
Almost surely, 210230447 is an apocalyptic number.
10230447 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
10230447 is a deficient number, since it is larger than the sum of its proper divisors (4212609).
10230447 is a wasteful number, since it uses less digits than its factorization.
10230447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200617.
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 10230447 is about 3198.5069954590. The cubic root of 10230447 is about 217.0858601104.
Adding to 10230447 its reverse (74403201), we get a palindrome (84633648).
The spelling of 10230447 in words is "ten million, two hundred thirty thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •