Base | Representation |
---|---|
bin | 111100010100100… |
… | …100000001101101 |
3 | 2121112022010010100 |
4 | 330110210001231 |
5 | 4033034222110 |
6 | 244231101313 |
7 | 34036025361 |
oct | 7424440155 |
9 | 2545263110 |
10 | 1012023405 |
11 | 47a296188 |
12 | 242b11839 |
13 | 131889a23 |
14 | 9859b2a1 |
15 | 5dca8bc0 |
hex | 3c52406d |
1012023405 has 12 divisors (see below), whose sum is σ = 1754173980. Its totient is φ = 539745792.
The previous prime is 1012023359. The next prime is 1012023443. The reversal of 1012023405 is 5043202101.
It can be written as a sum of positive squares in 2 ways, for example, as 582787881 + 429235524 = 24141^2 + 20718^2 .
It is not a de Polignac number, because 1012023405 - 222 = 1007829101 is a prime.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 11244660 + ... + 11244749.
It is an arithmetic number, because the mean of its divisors is an integer number (146181165).
Almost surely, 21012023405 is an apocalyptic number.
1012023405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1012023405 is a deficient number, since it is larger than the sum of its proper divisors (742150575).
1012023405 is a wasteful number, since it uses less digits than its factorization.
1012023405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22489420 (or 22489417 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 1012023405 is about 31812.3153039825. The cubic root of 1012023405 is about 1003.9918456320.
Adding to 1012023405 its reverse (5043202101), we get a palindrome (6055225506).
The spelling of 1012023405 in words is "one billion, twelve million, twenty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •