Base | Representation |
---|---|
bin | 11001101000111110… |
… | …01001000011011001 |
3 | 1022112100011212112020 |
4 | 30310133021003121 |
5 | 211142430340130 |
6 | 10153534005053 |
7 | 665056440456 |
oct | 146437110331 |
9 | 38470155466 |
10 | 13765480665 |
11 | 5924289402 |
12 | 2802046789 |
13 | 13b4b59841 |
14 | 9482aa82d |
15 | 55875ae10 |
hex | 3347c90d9 |
13765480665 has 16 divisors (see below), whose sum is σ = 22183224000. Its totient is φ = 7288771392.
The previous prime is 13765480661. The next prime is 13765480667. The reversal of 13765480665 is 56608456731.
13765480665 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13765480665 - 22 = 13765480661 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13765480661) 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 15 ways as a sum of consecutive naturals, for example, 3298990 + ... + 3303159.
It is an arithmetic number, because the mean of its divisors is an integer number (1386451500).
Almost surely, 213765480665 is an apocalyptic number.
13765480665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13765480665 is a deficient number, since it is larger than the sum of its proper divisors (8417743335).
13765480665 is a wasteful number, since it uses less digits than its factorization.
13765480665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6602296.
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 13765480665 in words is "thirteen billion, seven hundred sixty-five million, four hundred eighty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •