Base | Representation |
---|---|
bin | 11001010101010… |
… | …111101001010000 |
3 | 1002121202212200000 |
4 | 121111113221100 |
5 | 1332302013042 |
6 | 110101530000 |
7 | 13350500100 |
oct | 3125275120 |
9 | 1077685600 |
10 | 425032272 |
11 | 1a8a13045 |
12 | ba413900 |
13 | 6a0973b2 |
14 | 4063d200 |
15 | 274aa74c |
hex | 19557a50 |
425032272 has 360 divisors, whose sum is σ = 1512778176. Its totient is φ = 114960384.
The previous prime is 425032271. The next prime is 425032277. The reversal of 425032272 is 272230524.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425032271) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 4381728 + ... + 4381824.
Almost surely, 2425032272 is an apocalyptic number.
425032272 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 425032272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (756389088).
425032272 is an abundant number, since it is smaller than the sum of its proper divisors (1087745904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425032272 is a wasteful number, since it uses less digits than its factorization.
425032272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157 (or 132 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 27.
The square root of 425032272 is about 20616.3108241994. The cubic root of 425032272 is about 751.8663279079.
Adding to 425032272 its reverse (272230524), we get a palindrome (697262796).
The spelling of 425032272 in words is "four hundred twenty-five million, thirty-two thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •