Base | Representation |
---|---|
bin | 11001011100101000… |
… | …11001001110001011 |
3 | 1022021010110111202102 |
4 | 30232110121032023 |
5 | 210434433000021 |
6 | 10135400024015 |
7 | 662362040552 |
oct | 145624311613 |
9 | 38233414672 |
10 | 13662000011 |
11 | 588092a900 |
12 | 279346200b |
13 | 139959799a |
14 | 938650d99 |
15 | 54e61a00b |
hex | 32e51938b |
13662000011 has 24 divisors (see below), whose sum is σ = 15239501760. Its totient is φ = 12236590080.
The previous prime is 13661999983. The next prime is 13662000041. The reversal of 13662000011 is 11000026631.
13662000011 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 13662000011 - 226 = 13594891147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13662000041) 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 23 ways as a sum of consecutive naturals, for example, 5514305 + ... + 5516781.
It is an arithmetic number, because the mean of its divisors is an integer number (634979240).
Almost surely, 213662000011 is an apocalyptic number.
13662000011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13662000011 is a deficient number, since it is larger than the sum of its proper divisors (1577501749).
13662000011 is a wasteful number, since it uses less digits than its factorization.
13662000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3155 (or 3144 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13662000011 its reverse (11000026631), we get a palindrome (24662026642).
The spelling of 13662000011 in words is "thirteen billion, six hundred sixty-two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •