Base | Representation |
---|---|
bin | 10101000110101111… |
… | …01000001010010111 |
3 | 1002020122221000120120 |
4 | 22203113220022113 |
5 | 141201142031430 |
6 | 5112202403023 |
7 | 550534222641 |
oct | 124327501227 |
9 | 32218830516 |
10 | 11330814615 |
11 | 4894a497aa |
12 | 2242800473 |
13 | 10b7624143 |
14 | 796bc5891 |
15 | 464b38610 |
hex | 2a35e8297 |
11330814615 has 32 divisors (see below), whose sum is σ = 18487486656. Its totient is φ = 5923906560.
The previous prime is 11330814613. The next prime is 11330814617. The reversal of 11330814615 is 51641803311.
11330814615 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11330814613) and next prime (11330814617).
It is not a de Polignac number, because 11330814615 - 21 = 11330814613 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330814613) 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 31 ways as a sum of consecutive naturals, for example, 1009635 + ... + 1020795.
It is an arithmetic number, because the mean of its divisors is an integer number (577733958).
Almost surely, 211330814615 is an apocalyptic number.
11330814615 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11330814615 is a deficient number, since it is larger than the sum of its proper divisors (7156672041).
11330814615 is a wasteful number, since it uses less digits than its factorization.
11330814615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12499.
The product of its (nonzero) digits is 8640, while the sum is 33.
The spelling of 11330814615 in words is "eleven billion, three hundred thirty million, eight hundred fourteen thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.870 sec. • engine limits •