Base | Representation |
---|---|
bin | 11000010100010101… |
… | …11111100000110011 |
3 | 1020200212022221110121 |
4 | 30022022333200303 |
5 | 203214210240020 |
6 | 5555253511111 |
7 | 641346251263 |
oct | 141212774063 |
9 | 36625287417 |
10 | 13055555635 |
11 | 559a580201 |
12 | 2644342497 |
13 | 1300a53a65 |
14 | 8bbcab7a3 |
15 | 516277baa |
hex | 30a2bf833 |
13055555635 has 16 divisors (see below), whose sum is σ = 16180020000. Its totient is φ = 10105364736.
The previous prime is 13055555621. The next prime is 13055555651. The reversal of 13055555635 is 53655555031.
13055555635 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13055555635 - 27 = 13055555507 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13055555591 and 13055555600.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 164010 + ... + 230239.
It is an arithmetic number, because the mean of its divisors is an integer number (1011251250).
Almost surely, 213055555635 is an apocalyptic number.
13055555635 is a deficient number, since it is larger than the sum of its proper divisors (3124464365).
13055555635 is a wasteful number, since it uses less digits than its factorization.
13055555635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394470.
The product of its (nonzero) digits is 843750, while the sum is 43.
The spelling of 13055555635 in words is "thirteen billion, fifty-five million, five hundred fifty-five thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •