Base | Representation |
---|---|
bin | 11001010101110… |
… | …101000011111100 |
3 | 1002121222222221200 |
4 | 121111311003330 |
5 | 1332314342024 |
6 | 110104255500 |
7 | 13351511301 |
oct | 3125650374 |
9 | 1077888850 |
10 | 425152764 |
11 | 1a8a95623 |
12 | ba471590 |
13 | 6a10a1aa |
14 | 406710a8 |
15 | 274d12c9 |
hex | 195750fc |
425152764 has 18 divisors (see below), whose sum is σ = 1074691800. Its totient is φ = 141717576.
The previous prime is 425152753. The next prime is 425152781. The reversal of 425152764 is 467251524.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-4 number, since 4×4251527644 (a number of 36 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 11809799 = 425152764 / (4 + 2 + 5 + 1 + 5 + 2 + 7 + 6 + 4).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5904864 + ... + 5904935.
It is an arithmetic number, because the mean of its divisors is an integer number (59705100).
Almost surely, 2425152764 is an apocalyptic number.
It is an amenable number.
425152764 is an abundant number, since it is smaller than the sum of its proper divisors (649539036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425152764 is a wasteful number, since it uses less digits than its factorization.
425152764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11809809 (or 11809804 counting only the distinct ones).
The product of its digits is 67200, while the sum is 36.
The square root of 425152764 is about 20619.2328664284. The cubic root of 425152764 is about 751.9373698217.
The spelling of 425152764 in words is "four hundred twenty-five million, one hundred fifty-two thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •