Base | Representation |
---|---|
bin | 100100001001011101101… |
… | …000101110100011001001 |
3 | 22210110210120000001022120 |
4 | 210021131220232203021 |
5 | 311144324341221401 |
6 | 5141055022441453 |
7 | 344316242036331 |
oct | 44113550564311 |
9 | 8713716001276 |
10 | 2484062054601 |
11 | 8785372a7a86 |
12 | 341517433289 |
13 | 15032774510a |
14 | 8832d0960c1 |
15 | 449397c6836 |
hex | 2425da2e8c9 |
2484062054601 has 4 divisors (see below), whose sum is σ = 3312082739472. Its totient is φ = 1656041369732.
The previous prime is 2484062054561. The next prime is 2484062054611. The reversal of 2484062054601 is 1064502604842.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2484062054601 - 213 = 2484062046409 is a prime.
It is a super-2 number, since 2×24840620546012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2484062054611) 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, 414010342431 + ... + 414010342436.
It is an arithmetic number, because the mean of its divisors is an integer number (828020684868).
Almost surely, 22484062054601 is an apocalyptic number.
It is an amenable number.
2484062054601 is a deficient number, since it is larger than the sum of its proper divisors (828020684871).
2484062054601 is an equidigital number, since it uses as much as digits as its factorization.
2484062054601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828020684870.
The product of its (nonzero) digits is 368640, while the sum is 42.
The spelling of 2484062054601 in words is "two trillion, four hundred eighty-four billion, sixty-two million, fifty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •