Base | Representation |
---|---|
bin | 1001001111010101… |
… | …0001101000110111 |
3 | 20101211222001121020 |
4 | 2103311101220313 |
5 | 20034413413011 |
6 | 1050035352223 |
7 | 115314331164 |
oct | 22365215067 |
9 | 6354861536 |
10 | 2480216631 |
11 | 1063021512 |
12 | 592752673 |
13 | 306ac3809 |
14 | 19758106b |
15 | e7b1e006 |
hex | 93d51a37 |
2480216631 has 8 divisors (see below), whose sum is σ = 3310589184. Its totient is φ = 1651660920.
The previous prime is 2480216573. The next prime is 2480216647. The reversal of 2480216631 is 1366120842.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2480216631 - 210 = 2480215607 is a prime.
It is a super-2 number, since 2×24802166312 = 12302949073377980322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2480216592 and 2480216601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2480216131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451021 + ... + 456486.
It is an arithmetic number, because the mean of its divisors is an integer number (413823648).
Almost surely, 22480216631 is an apocalyptic number.
2480216631 is a deficient number, since it is larger than the sum of its proper divisors (830372553).
2480216631 is an equidigital number, since it uses as much as digits as its factorization.
2480216631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908421.
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 2480216631 is about 49801.7733720397. The cubic root of 2480216631 is about 1353.6193015542.
The spelling of 2480216631 in words is "two billion, four hundred eighty million, two hundred sixteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •