Base | Representation |
---|---|
bin | 101010011110100… |
… | …0101101001000000 |
3 | 10200022221202002002 |
4 | 1110331011221000 |
5 | 10404334100112 |
6 | 353233043132 |
7 | 50214564452 |
oct | 12475055100 |
9 | 3608852062 |
10 | 1425300032 |
11 | 6715aa012 |
12 | 3393b64a8 |
13 | 199399400 |
14 | d741a2d2 |
15 | 851e11c2 |
hex | 54f45a40 |
1425300032 has 42 divisors (see below), whose sum is σ = 3062652498. Its totient is φ = 657825792.
The previous prime is 1425300031. The next prime is 1425300047. The reversal of 1425300032 is 2300035241.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 55115776 + 1370184256 = 7424^2 + 37016^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1425299977 and 1425300013.
It is not an unprimeable number, because it can be changed into a prime (1425300031) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 55073 + ... + 76704.
Almost surely, 21425300032 is an apocalyptic number.
It is an amenable number.
1425300032 is an abundant number, since it is smaller than the sum of its proper divisors (1637352466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425300032 is a wasteful number, since it uses less digits than its factorization.
1425300032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131815 (or 131792 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 1425300032 is about 37753.1459881160. The cubic root of 1425300032 is about 1125.3875292413.
Adding to 1425300032 its reverse (2300035241), we get a palindrome (3725335273).
The spelling of 1425300032 in words is "one billion, four hundred twenty-five million, three hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •