Base | Representation |
---|---|
bin | 100100000110000000010… |
… | …000000111111101100001 |
3 | 22210010012201001102012220 |
4 | 210012000100013331201 |
5 | 311114223021342403 |
6 | 5135242302141253 |
7 | 344125221531345 |
oct | 44060020077541 |
9 | 8703181042186 |
10 | 2480347840353 |
11 | 876a00769929 |
12 | 34085b581829 |
13 | 14cb850b56c6 |
14 | 88099a95625 |
15 | 447bd6a3953 |
hex | 24180407f61 |
2480347840353 has 8 divisors (see below), whose sum is σ = 3307212554016. Its totient is φ = 1653524176800.
The previous prime is 2480347840351. The next prime is 2480347840357. The reversal of 2480347840353 is 3530487430842.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2480347840353 - 21 = 2480347840351 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 2480347840296 and 2480347840305.
It is not an unprimeable number, because it can be changed into a prime (2480347840351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10121263 + ... + 10363428.
It is an arithmetic number, because the mean of its divisors is an integer number (413401569252).
Almost surely, 22480347840353 is an apocalyptic number.
It is an amenable number.
2480347840353 is a deficient number, since it is larger than the sum of its proper divisors (826864713663).
2480347840353 is a wasteful number, since it uses less digits than its factorization.
2480347840353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20525055.
The product of its (nonzero) digits is 7741440, while the sum is 51.
The spelling of 2480347840353 in words is "two trillion, four hundred eighty billion, three hundred forty-seven million, eight hundred forty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •