Base | Representation |
---|---|
bin | 11001011100000011… |
… | …00010000010000100 |
3 | 1022020210011021222100 |
4 | 30232001202002010 |
5 | 210432201232424 |
6 | 10135102032100 |
7 | 662302024641 |
oct | 145601420204 |
9 | 38223137870 |
10 | 13657055364 |
11 | 5879062917 |
12 | 2791878630 |
13 | 1398556164 |
14 | 937b24dc8 |
15 | 54de8edc9 |
hex | 32e062084 |
13657055364 has 36 divisors (see below), whose sum is σ = 34612171776. Its totient is φ = 4540461168.
The previous prime is 13657055359. The next prime is 13657055387. The reversal of 13657055364 is 46355075631.
13657055364 is a `hidden beast` number, since 1 + 36 + 5 + 7 + 0 + 553 + 64 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×136570553642 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 481464 + ... + 509039.
It is an arithmetic number, because the mean of its divisors is an integer number (961449216).
Almost surely, 213657055364 is an apocalyptic number.
It is an amenable number.
13657055364 is an abundant number, since it is smaller than the sum of its proper divisors (20955116412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13657055364 is a wasteful number, since it uses less digits than its factorization.
13657055364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990896 (or 990891 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 45.
The spelling of 13657055364 in words is "thirteen billion, six hundred fifty-seven million, fifty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •