Base | Representation |
---|---|
bin | 111101110001101… |
… | …000100100110001 |
3 | 2200020012122220201 |
4 | 331301220210301 |
5 | 4110310441200 |
6 | 250502035201 |
7 | 34453302544 |
oct | 7561504461 |
9 | 2606178821 |
10 | 1036421425 |
11 | 49203a836 |
12 | 24b118b01 |
13 | 13694cc20 |
14 | 9b90c85b |
15 | 60ec7c6a |
hex | 3dc68931 |
1036421425 has 12 divisors (see below), whose sum is σ = 1384021660. Its totient is φ = 765357120.
The previous prime is 1036421417. The next prime is 1036421431. The reversal of 1036421425 is 5241246301.
1036421425 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 6 ways, for example, as 113294736 + 923126689 = 10644^2 + 30383^2 .
It is not a de Polignac number, because 1036421425 - 23 = 1036421417 is a prime.
It is a super-3 number, since 3×10364214253 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1036421393 and 1036421402.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1594170 + ... + 1594819.
Almost surely, 21036421425 is an apocalyptic number.
It is an amenable number.
1036421425 is a deficient number, since it is larger than the sum of its proper divisors (347600235).
1036421425 is a wasteful number, since it uses less digits than its factorization.
1036421425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3189012 (or 3189007 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 1036421425 is about 32193.4997320888. The cubic root of 1036421425 is about 1011.9959956645.
Adding to 1036421425 its reverse (5241246301), we get a palindrome (6277667726).
The spelling of 1036421425 in words is "one billion, thirty-six million, four hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •