Base | Representation |
---|---|
bin | 100100111111100110100… |
… | …100110011011000000101 |
3 | 100000000211212122212121001 |
4 | 210333212210303120011 |
5 | 313122403141013422 |
6 | 5223511241453301 |
7 | 351444640064611 |
oct | 44774644633005 |
9 | 10000755585531 |
10 | 2542194079237 |
11 | 8a015831254a |
12 | 35083b7a1231 |
13 | 1559601a2127 |
14 | 8b08581a341 |
15 | 461dd045227 |
hex | 24fe6933605 |
2542194079237 has 4 divisors (see below), whose sum is σ = 2542305665376. Its totient is φ = 2542082493100.
The previous prime is 2542194079223. The next prime is 2542194079351. The reversal of 2542194079237 is 7329704912452.
2542194079237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a de Polignac number, because none of the positive numbers 2k-2542194079237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2542194079207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55758889 + ... + 55804462.
It is an arithmetic number, because the mean of its divisors is an integer number (635576416344).
Almost surely, 22542194079237 is an apocalyptic number.
It is an amenable number.
2542194079237 is a deficient number, since it is larger than the sum of its proper divisors (111586139).
2542194079237 is a wasteful number, since it uses less digits than its factorization.
2542194079237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111586138.
The product of its (nonzero) digits is 7620480, while the sum is 55.
The spelling of 2542194079237 in words is "two trillion, five hundred forty-two billion, one hundred ninety-four million, seventy-nine thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •