Base | Representation |
---|---|
bin | 111100010101110… |
… | …010000011110001 |
3 | 2121112220100120010 |
4 | 330111302003301 |
5 | 4033124434100 |
6 | 244242005133 |
7 | 34041526251 |
oct | 7425620361 |
9 | 2545810503 |
10 | 1012343025 |
11 | 47a494331 |
12 | 2430467a9 |
13 | 13196c355 |
14 | 98641961 |
15 | 5dd1d750 |
hex | 3c5720f1 |
1012343025 has 24 divisors (see below), whose sum is σ = 1675757824. Its totient is φ = 539265600.
The previous prime is 1012343021. The next prime is 1012343041. The reversal of 1012343025 is 5203432101.
1012343025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1012343025 - 22 = 1012343021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1012342992 and 1012343010.
It is not an unprimeable number, because it can be changed into a prime (1012343021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58080 + ... + 73470.
Almost surely, 21012343025 is an apocalyptic number.
1012343025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1012343025 is a deficient number, since it is larger than the sum of its proper divisors (663414799).
1012343025 is a wasteful number, since it uses less digits than its factorization.
1012343025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16281 (or 16276 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 1012343025 is about 31817.3384336277. The cubic root of 1012343025 is about 1004.0975289907.
Adding to 1012343025 its reverse (5203432101), we get a palindrome (6215775126).
The spelling of 1012343025 in words is "one billion, twelve million, three hundred forty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •