Base | Representation |
---|---|
bin | 100111000101… |
… | …011100001001 |
3 | 201021112201200 |
4 | 213011130021 |
5 | 10110332042 |
6 | 1003334413 |
7 | 153042264 |
oct | 47053411 |
9 | 21245650 |
10 | 10245897 |
11 | 5868992 |
12 | 3521409 |
13 | 217977c |
14 | 1509cdb |
15 | d75c4c |
hex | 9c5709 |
10245897 has 6 divisors (see below), whose sum is σ = 14799642. Its totient is φ = 6830592.
The previous prime is 10245887. The next prime is 10245901. The reversal of 10245897 is 79854201.
10245897 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10169721 + 76176 = 3189^2 + 276^2 .
It is not a de Polignac number, because 10245897 - 210 = 10244873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10245817) 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 5 ways as a sum of consecutive naturals, for example, 569208 + ... + 569225.
It is an arithmetic number, because the mean of its divisors is an integer number (2466607).
Almost surely, 210245897 is an apocalyptic number.
It is an amenable number.
10245897 is a deficient number, since it is larger than the sum of its proper divisors (4553745).
10245897 is a wasteful number, since it uses less digits than its factorization.
10245897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138439 (or 1138436 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 10245897 is about 3200.9212736336. The cubic root of 10245897 is about 217.1950860177.
It can be divided in two parts, 1024589 and 7, that added together give a triangular number (1024596 = T1431).
The spelling of 10245897 in words is "ten million, two hundred forty-five thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •