Base | Representation |
---|---|
bin | 111110111000101011… |
… | …1111110111001000001 |
3 | 110220120121001121102202 |
4 | 1331301113332321001 |
5 | 4203033300122442 |
6 | 142012254322545 |
7 | 12520365616532 |
oct | 1756127767101 |
9 | 426517047382 |
10 | 135046098497 |
11 | 52300002672 |
12 | 2220a7b9455 |
13 | c972453a2b |
14 | 677172a689 |
15 | 37a5d73c32 |
hex | 1f715fee41 |
135046098497 has 2 divisors, whose sum is σ = 135046098498. Its totient is φ = 135046098496.
The previous prime is 135046098491. The next prime is 135046098503. The reversal of 135046098497 is 794890640531.
It is a balanced prime because it is at equal distance from previous prime (135046098491) and next prime (135046098503).
It can be written as a sum of positive squares in only one way, i.e., 124414220176 + 10631878321 = 352724^2 + 103111^2 .
It is a cyclic number.
It is not a de Polignac number, because 135046098497 - 232 = 130751131201 is a prime.
It is a super-2 number, since 2×1350460984972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (135046098491) 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 as a sum of consecutive naturals, namely, 67523049248 + 67523049249.
It is an arithmetic number, because the mean of its divisors is an integer number (67523049249).
Almost surely, 2135046098497 is an apocalyptic number.
It is an amenable number.
135046098497 is a deficient number, since it is larger than the sum of its proper divisors (1).
135046098497 is an equidigital number, since it uses as much as digits as its factorization.
135046098497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 135046098497 in words is "one hundred thirty-five billion, forty-six million, ninety-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •