Base | Representation |
---|---|
bin | 11110111010101001110… |
… | …101011101000010011001 |
3 | 21112002212110111100201011 |
4 | 132322221311131002121 |
5 | 234302101140100142 |
6 | 4304002202453521 |
7 | 306331441200640 |
oct | 36725165350231 |
9 | 7462773440634 |
10 | 2124563206297 |
11 | 74a0275a7384 |
12 | 2a3907b042a1 |
13 | 125464c556bc |
14 | 74b87c76357 |
15 | 3a3e88a9417 |
hex | 1eea9d5d099 |
2124563206297 has 8 divisors (see below), whose sum is σ = 2458807328000. Its totient is φ = 1798002857664.
The previous prime is 2124563206279. The next prime is 2124563206307. The reversal of 2124563206297 is 7926023654212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2124563206297 - 215 = 2124563173529 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2124563206297.
It is not an unprimeable number, because it can be changed into a prime (2124563206247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1920942672 + ... + 1920943777.
It is an arithmetic number, because the mean of its divisors is an integer number (307350916000).
Almost surely, 22124563206297 is an apocalyptic number.
It is an amenable number.
2124563206297 is a deficient number, since it is larger than the sum of its proper divisors (334244121703).
2124563206297 is an equidigital number, since it uses as much as digits as its factorization.
2124563206297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3841886535.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 2124563206297 in words is "two trillion, one hundred twenty-four billion, five hundred sixty-three million, two hundred six thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •