Base | Representation |
---|---|
bin | 10010001111010110010… |
… | …000100101010100010001 |
3 | 11102211022200222012000001 |
4 | 102033112100211110101 |
5 | 131014011104421023 |
6 | 2355452354130001 |
7 | 156362111344165 |
oct | 22172620452421 |
9 | 4384280865001 |
10 | 1253430154513 |
11 | 443638710a89 |
12 | 182b0b280901 |
13 | 91275baa954 |
14 | 44948634ca5 |
15 | 229107926ad |
hex | 123d6425511 |
1253430154513 has 4 divisors (see below), whose sum is σ = 1253514786228. Its totient is φ = 1253345522800.
The previous prime is 1253430154441. The next prime is 1253430154547. The reversal of 1253430154513 is 3154510343521.
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 921738245184 + 331691909329 = 960072^2 + 575927^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1253430154513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1253430154553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42293638 + ... + 42323263.
It is an arithmetic number, because the mean of its divisors is an integer number (313378696557).
Almost surely, 21253430154513 is an apocalyptic number.
It is an amenable number.
1253430154513 is a deficient number, since it is larger than the sum of its proper divisors (84631715).
1253430154513 is an equidigital number, since it uses as much as digits as its factorization.
1253430154513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84631714.
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 1253430154513 in words is "one trillion, two hundred fifty-three billion, four hundred thirty million, one hundred fifty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •