Base | Representation |
---|---|
bin | 101010011110001… |
… | …0110010011001101 |
3 | 10200022120220002100 |
4 | 1110330112103031 |
5 | 10404311344000 |
6 | 353224545313 |
7 | 50213126232 |
oct | 12474262315 |
9 | 3608526070 |
10 | 1425106125 |
11 | 671487363 |
12 | 339322239 |
13 | 19932c081 |
14 | d73a9789 |
15 | 851a3a00 |
hex | 54f164cd |
1425106125 has 24 divisors (see below), whose sum is σ = 2568993336. Its totient is φ = 760056000.
The previous prime is 1425106121. The next prime is 1425106127. The reversal of 1425106125 is 5216015241.
1425106125 is a `hidden beast` number, since 1 + 42 + 5 + 1 + 0 + 612 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 218655369 + 1206450756 = 14787^2 + 34734^2 .
It is not a de Polignac number, because 1425106125 - 22 = 1425106121 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425106121) 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, 632256 + ... + 634505.
It is an arithmetic number, because the mean of its divisors is an integer number (107041389).
Almost surely, 21425106125 is an apocalyptic number.
1425106125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1425106125 is a deficient number, since it is larger than the sum of its proper divisors (1143887211).
1425106125 is a wasteful number, since it uses less digits than its factorization.
1425106125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1266782 (or 1266769 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 1425106125 is about 37750.5778101475. The cubic root of 1425106125 is about 1125.3364919365.
The spelling of 1425106125 in words is "one billion, four hundred twenty-five million, one hundred six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •