Base | Representation |
---|---|
bin | 11000101110000100… |
… | …11010101110111110 |
3 | 1021020220111120020200 |
4 | 30113002122232332 |
5 | 204134440133041 |
6 | 10032524224330 |
7 | 646610065143 |
oct | 142702325676 |
9 | 37226446220 |
10 | 13271411646 |
11 | 56a0402aa9 |
12 | 26a469b0a6 |
13 | 13366a01cc |
14 | 8dc81a3ca |
15 | 52a1b51b6 |
hex | 31709abbe |
13271411646 has 12 divisors (see below), whose sum is σ = 28754725272. Its totient is φ = 4423803876.
The previous prime is 13271411633. The next prime is 13271411653. The reversal of 13271411646 is 64611417231.
13271411646 is a `hidden beast` number, since 1 + 3 + 2 + 7 + 1 + 4 + 1 + 1 + 646 = 666.
It is a super-2 number, since 2×132714116462 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13271411646.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 368650306 + ... + 368650341.
It is an arithmetic number, because the mean of its divisors is an integer number (2396227106).
Almost surely, 213271411646 is an apocalyptic number.
13271411646 is an abundant number, since it is smaller than the sum of its proper divisors (15483313626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13271411646 is a wasteful number, since it uses less digits than its factorization.
13271411646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737300655 (or 737300652 counting only the distinct ones).
The product of its digits is 24192, while the sum is 36.
Adding to 13271411646 its reverse (64611417231), we get a palindrome (77882828877).
The spelling of 13271411646 in words is "thirteen billion, two hundred seventy-one million, four hundred eleven thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •