Base | Representation |
---|---|
bin | 1011111011001010101100… |
… | …1110111111101100010110 |
3 | 1201102102002000020220010010 |
4 | 2332302223032333230112 |
5 | 3204303024413202410 |
6 | 43515055010141050 |
7 | 2522150413612536 |
oct | 276625316775426 |
9 | 51372060226103 |
10 | 13111113022230 |
11 | 41a5434549993 |
12 | 1579031281786 |
13 | 7414ac945352 |
14 | 33481cd774c6 |
15 | 17b0b4338c20 |
hex | becab3bfb16 |
13111113022230 has 64 divisors (see below), whose sum is σ = 31662877771008. Its totient is φ = 3474500365440.
The previous prime is 13111113022213. The next prime is 13111113022237. The reversal of 13111113022230 is 3222031111131.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13111113022197 and 13111113022206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111113022237) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50859460 + ... + 51116600.
It is an arithmetic number, because the mean of its divisors is an integer number (494732465172).
Almost surely, 213111113022230 is an apocalyptic number.
13111113022230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13111113022230 is an abundant number, since it is smaller than the sum of its proper divisors (18551764748778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13111113022230 is a wasteful number, since it uses less digits than its factorization.
13111113022230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267741.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13111113022230 its reverse (3222031111131), we get a palindrome (16333144133361).
The spelling of 13111113022230 in words is "thirteen trillion, one hundred eleven billion, one hundred thirteen million, twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •