Base | Representation |
---|---|
bin | 100100111000011000000… |
… | …110110011001110100001 |
3 | 22222021211010211221121011 |
4 | 210320120012303032201 |
5 | 313011010343444023 |
6 | 5220145312500521 |
7 | 351051444150163 |
oct | 44703006631641 |
9 | 8867733757534 |
10 | 2534435140513 |
11 | 897936622aa1 |
12 | 34b23524a741 |
13 | 154cc4891c23 |
14 | 8a94b182933 |
15 | 45dd6cb550d |
hex | 24e181b33a1 |
2534435140513 has 4 divisors (see below), whose sum is σ = 2534531764500. Its totient is φ = 2534338516528.
The previous prime is 2534435140507. The next prime is 2534435140571. The reversal of 2534435140513 is 3150415344352.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 559755356224 + 1974679784289 = 748168^2 + 1405233^2 .
It is a cyclic number.
It is not a de Polignac number, because 2534435140513 - 213 = 2534435132321 is a prime.
It is a super-2 number, since 2×25344351405132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2534435149513) 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, 48272638 + ... + 48325111.
It is an arithmetic number, because the mean of its divisors is an integer number (633632941125).
Almost surely, 22534435140513 is an apocalyptic number.
It is an amenable number.
2534435140513 is a deficient number, since it is larger than the sum of its proper divisors (96623987).
2534435140513 is an equidigital number, since it uses as much as digits as its factorization.
2534435140513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96623986.
The product of its (nonzero) digits is 432000, while the sum is 40.
The spelling of 2534435140513 in words is "two trillion, five hundred thirty-four billion, four hundred thirty-five million, one hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •