Base | Representation |
---|---|
bin | 1001011011010001… |
… | …0001010011111000 |
3 | 20112100011210012120 |
4 | 2112310101103320 |
5 | 20140223103132 |
6 | 1055024441240 |
7 | 116463031410 |
oct | 22664212370 |
9 | 6470153176 |
10 | 2530284792 |
11 | 1089309462 |
12 | 5a7479220 |
13 | 3142a3c49 |
14 | 1a0095640 |
15 | ec20e02c |
hex | 96d114f8 |
2530284792 has 64 divisors (see below), whose sum is σ = 7240389120. Its totient is φ = 721838208.
The previous prime is 2530284791. The next prime is 2530284793. The reversal of 2530284792 is 2974820352.
It is an interprime number because it is at equal distance from previous prime (2530284791) and next prime (2530284793).
It is a super-2 number, since 2×25302847922 = 12804682257252966528, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2530284791) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102613 + ... + 124859.
It is an arithmetic number, because the mean of its divisors is an integer number (113131080).
Almost surely, 22530284792 is an apocalyptic number.
It is an amenable number.
2530284792 is an abundant number, since it is smaller than the sum of its proper divisors (4710104328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530284792 is a wasteful number, since it uses less digits than its factorization.
2530284792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22940 (or 22936 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 42.
The square root of 2530284792 is about 50301.9362649193. The cubic root of 2530284792 is about 1362.6671979761.
The spelling of 2530284792 in words is "two billion, five hundred thirty million, two hundred eighty-four thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •