Base | Representation |
---|---|
bin | 10101001111111101100… |
… | …100100010001010110111 |
3 | 12011121011012110201021221 |
4 | 111033331210202022313 |
5 | 142411042010014020 |
6 | 3034455001051211 |
7 | 210333211163401 |
oct | 25177544421267 |
9 | 5147135421257 |
10 | 1460248126135 |
11 | 513318aa9177 |
12 | 1b700a186b07 |
13 | a791589b856 |
14 | 5096800bb71 |
15 | 27eb75766aa |
hex | 153fd9222b7 |
1460248126135 has 4 divisors (see below), whose sum is σ = 1752297751368. Its totient is φ = 1168198500904.
The previous prime is 1460248126133. The next prime is 1460248126171. The reversal of 1460248126135 is 5316218420641.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1460248126135 - 21 = 1460248126133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1460248126091 and 1460248126100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1460248126133) 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 3 ways as a sum of consecutive naturals, for example, 146024812609 + ... + 146024812618.
It is an arithmetic number, because the mean of its divisors is an integer number (438074437842).
Almost surely, 21460248126135 is an apocalyptic number.
1460248126135 is a deficient number, since it is larger than the sum of its proper divisors (292049625233).
1460248126135 is an equidigital number, since it uses as much as digits as its factorization.
1460248126135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292049625232.
The product of its (nonzero) digits is 276480, while the sum is 43.
The spelling of 1460248126135 in words is "one trillion, four hundred sixty billion, two hundred forty-eight million, one hundred twenty-six thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •