Base | Representation |
---|---|
bin | 101000101110011… |
… | …0111010010110101 |
3 | 10112020100110102101 |
4 | 1101130313102311 |
5 | 10244312133023 |
6 | 343333142101 |
7 | 45602144164 |
oct | 12134672265 |
9 | 3466313371 |
10 | 1366521013 |
11 | 641402510 |
12 | 32178a931 |
13 | 18a159120 |
14 | cd6b93db |
15 | 7ee801ad |
hex | 517374b5 |
1366521013 has 32 divisors (see below), whose sum is σ = 1754790912. Its totient is φ = 1044403200.
The previous prime is 1366520993. The next prime is 1366521019. The reversal of 1366521013 is 3101256631.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1366521013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1366521019) 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, 66295 + ... + 84427.
It is an arithmetic number, because the mean of its divisors is an integer number (54837216).
Almost surely, 21366521013 is an apocalyptic number.
1366521013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1366521013 is a deficient number, since it is larger than the sum of its proper divisors (388269899).
1366521013 is a wasteful number, since it uses less digits than its factorization.
1366521013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18205.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 1366521013 is about 36966.4849965479. The cubic root of 1366521013 is about 1109.6996219385.
Adding to 1366521013 its reverse (3101256631), we get a palindrome (4467777644).
The spelling of 1366521013 in words is "one billion, three hundred sixty-six million, five hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •