Base | Representation |
---|---|
bin | 111100010101110… |
… | …001010010001101 |
3 | 2121112220012012122 |
4 | 330111301102031 |
5 | 4033124333403 |
6 | 244241542325 |
7 | 34041514100 |
oct | 7425612215 |
9 | 2545805178 |
10 | 1012339853 |
11 | 47a491a08 |
12 | 2430449a5 |
13 | 13196aa85 |
14 | 98640737 |
15 | 5dd1c838 |
hex | 3c57148d |
1012339853 has 6 divisors (see below), whose sum is σ = 1177619886. Its totient is φ = 867719832.
The previous prime is 1012339849. The next prime is 1012339883. The reversal of 1012339853 is 3589332101.
It is a happy number.
1012339853 is digitally balanced in base 2, 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., 876337609 + 136002244 = 29603^2 + 11662^2 .
It is not a de Polignac number, because 1012339853 - 22 = 1012339849 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012339883) 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, 10329950 + ... + 10330047.
It is an arithmetic number, because the mean of its divisors is an integer number (196269981).
Almost surely, 21012339853 is an apocalyptic number.
It is an amenable number.
1012339853 is a deficient number, since it is larger than the sum of its proper divisors (165280033).
1012339853 is an equidigital number, since it uses as much as digits as its factorization.
1012339853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20660011 (or 20660004 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 1012339853 is about 31817.2885865531. The cubic root of 1012339853 is about 1004.0964802682.
The spelling of 1012339853 in words is "one billion, twelve million, three hundred thirty-nine thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •