Base | Representation |
---|---|
bin | 11000100110110000… |
… | …01111000011100000 |
3 | 1021002121222122122020 |
4 | 30103120033003200 |
5 | 204023231201422 |
6 | 10022452341440 |
7 | 645233223000 |
oct | 142330170340 |
9 | 37077878566 |
10 | 13210022112 |
11 | 5669793151 |
12 | 2688014880 |
13 | 1326a57941 |
14 | 8d45da000 |
15 | 524ada95c |
hex | 31360f0e0 |
13210022112 has 96 divisors (see below), whose sum is σ = 40438944000. Its totient is φ = 3774282624.
The previous prime is 13210022107. The next prime is 13210022113. The reversal of 13210022112 is 21122001231.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 13210022091 and 13210022100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210022113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167662 + ... + 233517.
It is an arithmetic number, because the mean of its divisors is an integer number (421239000).
Almost surely, 213210022112 is an apocalyptic number.
13210022112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13210022112 is an abundant number, since it is smaller than the sum of its proper divisors (27228921888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13210022112 is an equidigital number, since it uses as much as digits as its factorization.
13210022112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401213 (or 401191 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 13210022112 its reverse (21122001231), we get a palindrome (34332023343).
The spelling of 13210022112 in words is "thirteen billion, two hundred ten million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •