Base | Representation |
---|---|
bin | 1010000100000100010110… |
… | …11001001000101010100111 |
3 | 2220100121102110022022111222 |
4 | 11002002023121020222213 |
5 | 10400034230043143421 |
6 | 115022215235250555 |
7 | 4442561165301041 |
oct | 502021331105247 |
9 | 86317373268458 |
10 | 22130010131111 |
11 | 7062314877673 |
12 | 2594b3b749a5b |
13 | c46b0a85906c |
14 | 567153692a91 |
15 | 2859bba28cab |
hex | 14208b648aa7 |
22130010131111 has 4 divisors (see below), whose sum is σ = 22222604316000. Its totient is φ = 22037415946224.
The previous prime is 22130010131057. The next prime is 22130010131153. The reversal of 22130010131111 is 11113101003122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22130010131111 - 210 = 22130010130087 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22130010131111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22130010121111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46297092086 + ... + 46297092563.
It is an arithmetic number, because the mean of its divisors is an integer number (5555651079000).
Almost surely, 222130010131111 is an apocalyptic number.
22130010131111 is a deficient number, since it is larger than the sum of its proper divisors (92594184889).
22130010131111 is an equidigital number, since it uses as much as digits as its factorization.
22130010131111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92594184888.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 22130010131111 its reverse (11113101003122), we get a palindrome (33243111134233).
The spelling of 22130010131111 in words is "twenty-two trillion, one hundred thirty billion, ten million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •