Base | Representation |
---|---|
bin | 11001010000111111… |
… | …01111011000111110 |
3 | 1022000022122101202200 |
4 | 30220133233120332 |
5 | 210234430423402 |
6 | 10121550132330 |
7 | 660064512336 |
oct | 145037573076 |
9 | 38008571680 |
10 | 13564311102 |
11 | 5830777771 |
12 | 27667b10a6 |
13 | 13822830b4 |
14 | 9296a20c6 |
15 | 545c7021c |
hex | 3287ef63e |
13564311102 has 48 divisors (see below), whose sum is σ = 30078200880. Its totient is φ = 4416437376.
The previous prime is 13564311097. The next prime is 13564311107. The reversal of 13564311102 is 20111346531.
It is a happy number.
13564311102 is a `hidden beast` number, since 1 + 3 + 5 + 643 + 1 + 1 + 10 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (13564311097) and next prime (13564311107).
It is a super-3 number, since 3×135643111023 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13564311107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 126058 + ... + 207410.
It is an arithmetic number, because the mean of its divisors is an integer number (626629185).
Almost surely, 213564311102 is an apocalyptic number.
13564311102 is an abundant number, since it is smaller than the sum of its proper divisors (16513889778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13564311102 is a wasteful number, since it uses less digits than its factorization.
13564311102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81577 (or 81574 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 13564311102 its reverse (20111346531), we get a palindrome (33675657633).
The spelling of 13564311102 in words is "thirteen billion, five hundred sixty-four million, three hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •