Base | Representation |
---|---|
bin | 1001100101010000… |
… | …1010000101100000 |
3 | 20122021001012122111 |
4 | 2121110022011200 |
5 | 20231440320430 |
6 | 1103123045104 |
7 | 120512216143 |
oct | 23124120540 |
9 | 6567035574 |
10 | 2572198240 |
11 | 10aaa36677 |
12 | 5b9510794 |
13 | 31cb8a6c1 |
14 | 1a588605a |
15 | 100c3cc2a |
hex | 9950a160 |
2572198240 has 48 divisors (see below), whose sum is σ = 6110460720. Its totient is φ = 1023183360.
The previous prime is 2572198229. The next prime is 2572198259. The reversal of 2572198240 is 428912752.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2572198193 and 2572198202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15450 + ... + 73369.
It is an arithmetic number, because the mean of its divisors is an integer number (127301265).
Almost surely, 22572198240 is an apocalyptic number.
2572198240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2572198240 is an abundant number, since it is smaller than the sum of its proper divisors (3538262480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2572198240 is a wasteful number, since it uses less digits than its factorization.
2572198240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89015 (or 89007 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 2572198240 is about 50716.8437503755. The cubic root of 2572198240 is about 1370.1500963296.
The spelling of 2572198240 in words is "two billion, five hundred seventy-two million, one hundred ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •