Base | Representation |
---|---|
bin | 11001001100000100… |
… | …01110100100000011 |
3 | 1021220102221121001220 |
4 | 30212002032210003 |
5 | 210143343120120 |
6 | 10113513130123 |
7 | 656053526250 |
oct | 144602164403 |
9 | 37812847056 |
10 | 13523020035 |
11 | 580a435118 |
12 | 27549b9943 |
13 | 1376856a05 |
14 | 923dd4427 |
15 | 542315b40 |
hex | 32608e903 |
13523020035 has 32 divisors (see below), whose sum is σ = 24824074752. Its totient is φ = 6157885440.
The previous prime is 13523020031. The next prime is 13523020067. The reversal of 13523020035 is 53002032531.
It is a happy number.
It is not a de Polignac number, because 13523020035 - 22 = 13523020031 is a prime.
It is a super-2 number, since 2×135230200352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13523019987 and 13523020014.
It is not an unprimeable number, because it can be changed into a prime (13523020031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 223581 + ... + 277550.
It is an arithmetic number, because the mean of its divisors is an integer number (775752336).
Almost surely, 213523020035 is an apocalyptic number.
13523020035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13523020035 is a deficient number, since it is larger than the sum of its proper divisors (11301054717).
13523020035 is a wasteful number, since it uses less digits than its factorization.
13523020035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501403.
The product of its (nonzero) digits is 2700, while the sum is 24.
Adding to 13523020035 its reverse (53002032531), we get a palindrome (66525052566).
The spelling of 13523020035 in words is "thirteen billion, five hundred twenty-three million, twenty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •