Base | Representation |
---|---|
bin | 1001011011010001… |
… | …1011111110011001 |
3 | 20112100021000010101 |
4 | 2112310123332121 |
5 | 20140231002343 |
6 | 1055025415401 |
7 | 116463302641 |
oct | 22664337631 |
9 | 6470230111 |
10 | 2530328473 |
11 | 1089339262 |
12 | 5a749a561 |
13 | 3142baaaa |
14 | 1a00a7521 |
15 | ec21be4d |
hex | 96d1bf99 |
2530328473 has 4 divisors (see below), whose sum is σ = 2558759220. Its totient is φ = 2501897728.
The previous prime is 2530328453. The next prime is 2530328483. The reversal of 2530328473 is 3748230352.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1487490624 + 1042837849 = 38568^2 + 32293^2 .
It is a cyclic number.
It is not a de Polignac number, because 2530328473 - 213 = 2530320281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2530328413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14215240 + ... + 14215417.
It is an arithmetic number, because the mean of its divisors is an integer number (639689805).
Almost surely, 22530328473 is an apocalyptic number.
It is an amenable number.
2530328473 is a deficient number, since it is larger than the sum of its proper divisors (28430747).
2530328473 is an equidigital number, since it uses as much as digits as its factorization.
2530328473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28430746.
The product of its (nonzero) digits is 120960, while the sum is 37.
The square root of 2530328473 is about 50302.3704511030. The cubic root of 2530328473 is about 1362.6750392968.
The spelling of 2530328473 in words is "two billion, five hundred thirty million, three hundred twenty-eight thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •