Base | Representation |
---|---|
bin | 11000101000000111… |
… | …11010001110011100 |
3 | 1021010102112022202000 |
4 | 30110003322032130 |
5 | 204034144034012 |
6 | 10023542002300 |
7 | 645432436032 |
oct | 142403721634 |
9 | 37112468660 |
10 | 13221471132 |
11 | 56751a2a51 |
12 | 268ba16390 |
13 | 1329235bcc |
14 | 8d5d3a552 |
15 | 525aecddc |
hex | 3140fa39c |
13221471132 has 48 divisors (see below), whose sum is σ = 36294239520. Its totient is φ = 4147911936.
The previous prime is 13221471127. The next prime is 13221471143. The reversal of 13221471132 is 23117412231.
It is a super-2 number, since 2×132214711322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 13221471096 and 13221471105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3598783 + ... + 3602454.
It is an arithmetic number, because the mean of its divisors is an integer number (756129990).
Almost surely, 213221471132 is an apocalyptic number.
13221471132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13221471132 is an abundant number, since it is smaller than the sum of its proper divisors (23072768388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13221471132 is a wasteful number, since it uses less digits than its factorization.
13221471132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7201267 (or 7201259 counting only the distinct ones).
The product of its digits is 2016, while the sum is 27.
Adding to 13221471132 its reverse (23117412231), we get a palindrome (36338883363).
The spelling of 13221471132 in words is "thirteen billion, two hundred twenty-one million, four hundred seventy-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •