Base | Representation |
---|---|
bin | 1001100110101011011111… |
… | …10011101011100011001011 |
3 | 2202210002000010212102100002 |
4 | 10303111233303223203023 |
5 | 10232013212340410011 |
6 | 112530255535033215 |
7 | 4306612663022354 |
oct | 463255763534313 |
9 | 82702003772302 |
10 | 21120230013131 |
11 | 680304826a347 |
12 | 24512aa36b80b |
13 | ba28242cbb82 |
14 | 5303203a2d2b |
15 | 2695bb889c3b |
hex | 13356fceb8cb |
21120230013131 has 4 divisors (see below), whose sum is σ = 21129538182000. Its totient is φ = 21110921844264.
The previous prime is 21120230013109. The next prime is 21120230013199. The reversal of 21120230013131 is 13131003202112.
It is a happy number.
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 21120230013131 - 218 = 21120229750987 is a prime.
It is a super-2 number, since 2×211202300131312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21120230018131) 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, 4654081031 + ... + 4654085568.
It is an arithmetic number, because the mean of its divisors is an integer number (5282384545500).
Almost surely, 221120230013131 is an apocalyptic number.
21120230013131 is a deficient number, since it is larger than the sum of its proper divisors (9308168869).
21120230013131 is an equidigital number, since it uses as much as digits as its factorization.
21120230013131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9308168868.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21120230013131 its reverse (13131003202112), we get a palindrome (34251233215243).
The spelling of 21120230013131 in words is "twenty-one trillion, one hundred twenty billion, two hundred thirty million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •