Base | Representation |
---|---|
bin | 11000011011001101… |
… | …11110001111110100 |
3 | 1020211212211201000210 |
4 | 30031212332033310 |
5 | 203323441102012 |
6 | 10005113505420 |
7 | 642646356213 |
oct | 141546761764 |
9 | 36755751023 |
10 | 13113222132 |
11 | 561a08796a |
12 | 265b712270 |
13 | 130c99484a |
14 | 8c57dd07a |
15 | 51b36923c |
hex | 30d9be3f4 |
13113222132 has 24 divisors (see below), whose sum is σ = 30625594272. Its totient is φ = 4367063200.
The previous prime is 13113222131. The next prime is 13113222137. The reversal of 13113222132 is 23122231131.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 13113222099 and 13113222108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13113222131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 487719 + ... + 513902.
It is an arithmetic number, because the mean of its divisors is an integer number (1276066428).
Almost surely, 213113222132 is an apocalyptic number.
13113222132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13113222132 is an abundant number, since it is smaller than the sum of its proper divisors (17512372140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13113222132 is a wasteful number, since it uses less digits than its factorization.
13113222132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1002719 (or 1002717 counting only the distinct ones).
The product of its digits is 432, while the sum is 21.
Adding to 13113222132 its reverse (23122231131), we get a palindrome (36235453263).
The spelling of 13113222132 in words is "thirteen billion, one hundred thirteen million, two hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •