Base | Representation |
---|---|
bin | 1001011011010000… |
… | …0011011100000001 |
3 | 20112100001220021000 |
4 | 2112310003130001 |
5 | 20140214243334 |
6 | 1055023322213 |
7 | 116462403633 |
oct | 22664033401 |
9 | 6470056230 |
10 | 2530227969 |
11 | 108927a7a5 |
12 | 5a7450369 |
13 | 314284119 |
14 | 1a007ca53 |
15 | ec1ec299 |
hex | 96d03701 |
2530227969 has 32 divisors (see below), whose sum is σ = 3776263040. Its totient is φ = 1674374976.
The previous prime is 2530227941. The next prime is 2530227977. The reversal of 2530227969 is 9697220352.
It is a happy number.
2530227969 is a `hidden beast` number, since 2 + 530 + 2 + 27 + 96 + 9 = 666.
It is not a de Polignac number, because 2530227969 - 25 = 2530227937 is a prime.
It is a super-2 number, since 2×25302279692 = 12804107150219729922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2530227979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2789214 + ... + 2790120.
It is an arithmetic number, because the mean of its divisors is an integer number (118008220).
Almost surely, 22530227969 is an apocalyptic number.
It is an amenable number.
2530227969 is a deficient number, since it is larger than the sum of its proper divisors (1246035071).
2530227969 is a wasteful number, since it uses less digits than its factorization.
2530227969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566 (or 1560 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 45.
The square root of 2530227969 is about 50301.3714425362. The cubic root of 2530227969 is about 1362.6569973565.
The spelling of 2530227969 in words is "two billion, five hundred thirty million, two hundred twenty-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •