Base | Representation |
---|---|
bin | 1011110101111111111101… |
… | …1010111000101010101110 |
3 | 1201002220220122102120011210 |
4 | 2331133333122320222232 |
5 | 3201324213231041420 |
6 | 43410213141455250 |
7 | 2512555335046455 |
oct | 275377732705256 |
9 | 51086818376153 |
10 | 13022331112110 |
11 | 417081546a851 |
12 | 1563994411526 |
13 | 7360012ac418 |
14 | 3303d9b57b9c |
15 | 178b19dbc9e0 |
hex | bd7ff6b8aae |
13022331112110 has 32 divisors (see below), whose sum is σ = 31254765870240. Its totient is φ = 3472491496448.
The previous prime is 13022331112073. The next prime is 13022331112117. The reversal of 13022331112110 is 1121113322031.
It is a super-2 number, since 2×130223311121102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13022331112117) 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, 7318107 + ... + 8921846.
It is an arithmetic number, because the mean of its divisors is an integer number (976711433445).
Almost surely, 213022331112110 is an apocalyptic number.
13022331112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13022331112110 is an abundant number, since it is smaller than the sum of its proper divisors (18232434758130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13022331112110 is a wasteful number, since it uses less digits than its factorization.
13022331112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16266692.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13022331112110 its reverse (1121113322031), we get a palindrome (14143444434141).
The spelling of 13022331112110 in words is "thirteen trillion, twenty-two billion, three hundred thirty-one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •