Base | Representation |
---|---|
bin | 11000101100101101… |
… | …00010011111000101 |
3 | 1021020002212011200000 |
4 | 30112112202133011 |
5 | 204124014042221 |
6 | 10031433511513 |
7 | 646410240000 |
oct | 142626423705 |
9 | 37202764600 |
10 | 13259909061 |
11 | 5694966a33 |
12 | 26a0872599 |
13 | 13341a3749 |
14 | 8db0a4537 |
15 | 529191e26 |
hex | 3165a27c5 |
13259909061 has 60 divisors (see below), whose sum is σ = 23172650592. Its totient is φ = 7576757496.
The previous prime is 13259909027. The next prime is 13259909071. The reversal of 13259909061 is 16090995231.
It is a happy number.
13259909061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13259909061 - 211 = 13259907013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13259908998 and 13259909016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13259909071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 572080 + ... + 594806.
Almost surely, 213259909061 is an apocalyptic number.
It is an amenable number.
13259909061 is a deficient number, since it is larger than the sum of its proper divisors (9912741531).
13259909061 is an frugal number, since it uses more digits than its factorization.
13259909061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22770 (or 22737 counting only the distinct ones).
The product of its (nonzero) digits is 131220, while the sum is 45.
The spelling of 13259909061 in words is "thirteen billion, two hundred fifty-nine million, nine hundred nine thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •