Base | Representation |
---|---|
bin | 11001001100110110… |
… | …01001001000101111 |
3 | 1021220220020102102120 |
4 | 30212123021020233 |
5 | 210202031121112 |
6 | 10114305124023 |
7 | 656163201201 |
oct | 144633111057 |
9 | 37826212376 |
10 | 13529551407 |
11 | 5813096249 |
12 | 2757029613 |
13 | 1378002828 |
14 | 924c14771 |
15 | 542ba5e8c |
hex | 3266c922f |
13529551407 has 8 divisors (see below), whose sum is σ = 18988844160. Its totient is φ = 8544979800.
The previous prime is 13529551397. The next prime is 13529551411. The reversal of 13529551407 is 70415592531.
It is a happy number.
13529551407 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13529551407 - 24 = 13529551391 is a prime.
It is a super-2 number, since 2×135295514072 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13529551447) 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 7 ways as a sum of consecutive naturals, for example, 118680219 + ... + 118680332.
It is an arithmetic number, because the mean of its divisors is an integer number (2373605520).
Almost surely, 213529551407 is an apocalyptic number.
13529551407 is a deficient number, since it is larger than the sum of its proper divisors (5459292753).
13529551407 is a wasteful number, since it uses less digits than its factorization.
13529551407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237360573.
The product of its (nonzero) digits is 189000, while the sum is 42.
The spelling of 13529551407 in words is "thirteen billion, five hundred twenty-nine million, five hundred fifty-one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •