Base | Representation |
---|---|
bin | 111101000111100… |
… | …110011100000010 |
3 | 2122110110211222001 |
4 | 331013212130002 |
5 | 4100000341001 |
6 | 245425534214 |
7 | 34260531013 |
oct | 7507463402 |
9 | 2573424861 |
10 | 1025402626 |
11 | 4868a4196 |
12 | 2474a436a |
13 | 134592721 |
14 | 9a28100a |
15 | 6004d001 |
hex | 3d1e6702 |
1025402626 has 8 divisors (see below), whose sum is σ = 1538241804. Its totient is φ = 512655360.
The previous prime is 1025402611. The next prime is 1025402627. The reversal of 1025402626 is 6262045201.
1025402626 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 2 ways, for example, as 988788025 + 36614601 = 31445^2 + 6051^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1025402594 and 1025402603.
It is not an unprimeable number, because it can be changed into a prime (1025402627) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24706 + ... + 51586.
Almost surely, 21025402626 is an apocalyptic number.
1025402626 is a deficient number, since it is larger than the sum of its proper divisors (512839178).
1025402626 is a wasteful number, since it uses less digits than its factorization.
1025402626 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45956.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 1025402626 is about 32021.9085315039. The cubic root of 1025402626 is about 1008.3968377705.
Adding to 1025402626 its reverse (6262045201), we get a palindrome (7287447827).
It can be divided in two parts, 1025402 and 626, that added together give a triangular number (1026028 = T1432).
The spelling of 1025402626 in words is "one billion, twenty-five million, four hundred two thousand, six hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •