Base | Representation |
---|---|
bin | 11001011111000011… |
… | …00000010011110111 |
3 | 1022022112111111022200 |
4 | 30233201200103313 |
5 | 211010121323020 |
6 | 10141401155543 |
7 | 663025621062 |
oct | 145741402367 |
9 | 38275444280 |
10 | 13682214135 |
11 | 5891286a97 |
12 | 279a18bbb3 |
13 | 13a08246c5 |
14 | 93b1d38d9 |
15 | 5512ae590 |
hex | 32f8604f7 |
13682214135 has 12 divisors (see below), whose sum is σ = 23715837912. Its totient is φ = 7297180848.
The previous prime is 13682214121. The next prime is 13682214137. The reversal of 13682214135 is 53141228631.
13682214135 is a `hidden beast` number, since 1 + 368 + 221 + 41 + 35 = 666.
It is not a de Polignac number, because 13682214135 - 28 = 13682213879 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 13682214135.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13682214137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 152024557 + ... + 152024646.
It is an arithmetic number, because the mean of its divisors is an integer number (1976319826).
Almost surely, 213682214135 is an apocalyptic number.
13682214135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13682214135 is a deficient number, since it is larger than the sum of its proper divisors (10033623777).
13682214135 is a wasteful number, since it uses less digits than its factorization.
13682214135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304049214 (or 304049211 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
The spelling of 13682214135 in words is "thirteen billion, six hundred eighty-two million, two hundred fourteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •