Base | Representation |
---|---|
bin | 11000101110000111… |
… | …10010000000000000 |
3 | 1021020221011201120021 |
4 | 30113003302000000 |
5 | 204140033102323 |
6 | 10032540023224 |
7 | 646613114224 |
oct | 142703620000 |
9 | 37227151507 |
10 | 13271769088 |
11 | 56a0627606 |
12 | 26a4831b14 |
13 | 1336796b06 |
14 | 8dc8b0784 |
15 | 52a23605d |
hex | 3170f2000 |
13271769088 has 56 divisors (see below), whose sum is σ = 26906718348. Its totient is φ = 6544687104.
The previous prime is 13271769023. The next prime is 13271769127. The reversal of 13271769088 is 88096717231.
It can be written as a sum of positive squares in 2 ways, for example, as 12019175424 + 1252593664 = 109632^2 + 35392^2 .
It is a super-2 number, since 2×132717690882 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 586920 + ... + 609112.
Almost surely, 213271769088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13271769088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13453359174).
13271769088 is an abundant number, since it is smaller than the sum of its proper divisors (13634949260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13271769088 is an frugal number, since it uses more digits than its factorization.
13271769088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22292 (or 22268 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 52.
The spelling of 13271769088 in words is "thirteen billion, two hundred seventy-one million, seven hundred sixty-nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •