Base | Representation |
---|---|
bin | 10110010110001111011… |
… | …000111100100010111101 |
3 | 12102210221012102121001211 |
4 | 112112033120330202331 |
5 | 200130113001143023 |
6 | 3133254525404421 |
7 | 215644205112550 |
oct | 26261730744275 |
9 | 5383835377054 |
10 | 1535709006013 |
11 | 542321775106 |
12 | 209769a09711 |
13 | b1a804b0970 |
14 | 54485db6697 |
15 | 29e322caa0d |
hex | 1658f63c8bd |
1535709006013 has 16 divisors (see below), whose sum is σ = 1890390208000. Its totient is φ = 1214882084736.
The previous prime is 1535709005993. The next prime is 1535709006023. The reversal of 1535709006013 is 3106009075351.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1535709006013 - 221 = 1535706908861 is a prime.
It is a super-2 number, since 2×15357090060132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1535709006023) 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 15 ways as a sum of consecutive naturals, for example, 675888 + ... + 1878361.
It is an arithmetic number, because the mean of its divisors is an integer number (118149388000).
Almost surely, 21535709006013 is an apocalyptic number.
1535709006013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1535709006013 is a deficient number, since it is larger than the sum of its proper divisors (354681201987).
1535709006013 is a wasteful number, since it uses less digits than its factorization.
1535709006013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2560876.
The product of its (nonzero) digits is 85050, while the sum is 40.
The spelling of 1535709006013 in words is "one trillion, five hundred thirty-five billion, seven hundred nine million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •