Base | Representation |
---|---|
bin | 10110010101111110111… |
… | …111111011100111011001 |
3 | 12102210020000222111202210 |
4 | 112111332333323213121 |
5 | 200124032101410040 |
6 | 3133211343345333 |
7 | 215634325525224 |
oct | 26257677734731 |
9 | 5383200874683 |
10 | 1535434013145 |
11 | 5421a052097a |
12 | 2096b18b2249 |
13 | b1a3852a3a6 |
14 | 5445b6725bb |
15 | 29e180ab480 |
hex | 1657effb9d9 |
1535434013145 has 32 divisors (see below), whose sum is σ = 2469652149888. Its totient is φ = 814580540928.
The previous prime is 1535434013131. The next prime is 1535434013159. The reversal of 1535434013145 is 5413104345351.
It is an interprime number because it is at equal distance from previous prime (1535434013131) and next prime (1535434013159).
It is not a de Polignac number, because 1535434013145 - 212 = 1535434009049 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15751797 + ... + 15848973.
It is an arithmetic number, because the mean of its divisors is an integer number (77176629684).
Almost surely, 21535434013145 is an apocalyptic number.
1535434013145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1535434013145 is a deficient number, since it is larger than the sum of its proper divisors (934218136743).
1535434013145 is a wasteful number, since it uses less digits than its factorization.
1535434013145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102729.
The product of its (nonzero) digits is 216000, while the sum is 39.
Adding to 1535434013145 its reverse (5413104345351), we get a palindrome (6948538358496).
The spelling of 1535434013145 in words is "one trillion, five hundred thirty-five billion, four hundred thirty-four million, thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •