Base | Representation |
---|---|
bin | 101010011110000… |
… | …0100000001000000 |
3 | 10200022110002100112 |
4 | 1110330010001000 |
5 | 10404301444412 |
6 | 353223210452 |
7 | 50212365002 |
oct | 12474040100 |
9 | 3608402315 |
10 | 1425031232 |
11 | 671436069 |
12 | 3392a6a28 |
13 | 199303c61 |
14 | d738a372 |
15 | 8518b722 |
hex | 54f04040 |
1425031232 has 56 divisors (see below), whose sum is σ = 2945511000. Its totient is φ = 683196416.
The previous prime is 1425031199. The next prime is 1425031253. The reversal of 1425031232 is 2321305241.
It can be written as a sum of positive squares in 4 ways, for example, as 89567296 + 1335463936 = 9464^2 + 36544^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1425031198 and 1425031207.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 273968 + ... + 279120.
Almost surely, 21425031232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1425031232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1472755500).
1425031232 is an abundant number, since it is smaller than the sum of its proper divisors (1520479768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1425031232 is a wasteful number, since it uses less digits than its factorization.
1425031232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343 (or 5333 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 1425031232 is about 37749.5858520329. The cubic root of 1425031232 is about 1125.3167784801.
Adding to 1425031232 its reverse (2321305241), we get a palindrome (3746336473).
The spelling of 1425031232 in words is "one billion, four hundred twenty-five million, thirty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •