Base | Representation |
---|---|
bin | 100100100101011100010… |
… | …001110100001101100101 |
3 | 22220100100020022011001011 |
4 | 210211130101310031211 |
5 | 312142341113323331 |
6 | 5202544034502221 |
7 | 346431561522403 |
oct | 44453421641545 |
9 | 8810306264034 |
10 | 2514104042341 |
11 | 88a25320a021 |
12 | 347300434971 |
13 | 15310471b718 |
14 | 8997cd10473 |
15 | 455e6e463b1 |
hex | 2495c474365 |
2514104042341 has 8 divisors (see below), whose sum is σ = 2533801884768. Its totient is φ = 2494413870000.
The previous prime is 2514104042323. The next prime is 2514104042347. The reversal of 2514104042341 is 1432404014152.
It is a happy number.
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 2514104042341 - 235 = 2479744303973 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 (2514104042347) 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 7 ways as a sum of consecutive naturals, for example, 1258510 + ... + 2571391.
It is an arithmetic number, because the mean of its divisors is an integer number (316725235596).
Almost surely, 22514104042341 is an apocalyptic number.
It is an amenable number.
2514104042341 is a deficient number, since it is larger than the sum of its proper divisors (19697842427).
2514104042341 is a wasteful number, since it uses less digits than its factorization.
2514104042341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3835043.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 2514104042341 its reverse (1432404014152), we get a palindrome (3946508056493).
The spelling of 2514104042341 in words is "two trillion, five hundred fourteen billion, one hundred four million, forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •