Base | Representation |
---|---|
bin | 1001100110011110000100… |
… | …01111001110111100101011 |
3 | 2202202101101212122220100220 |
4 | 10303033002033032330223 |
5 | 10231403432344030011 |
6 | 112523104444301123 |
7 | 4306236251505021 |
oct | 463170217167453 |
9 | 82671355586326 |
10 | 21113023033131 |
11 | 67aaa8a0a5627 |
12 | 244ba188417a3 |
13 | ba1c46166873 |
14 | 52dc39168711 |
15 | 2692e8cd8506 |
hex | 1333c23cef2b |
21113023033131 has 16 divisors (see below), whose sum is σ = 28212086086656. Its totient is φ = 14044668770016.
The previous prime is 21113023033129. The next prime is 21113023033133. The reversal of 21113023033131 is 13133032031112.
It is an interprime number because it is at equal distance from previous prime (21113023033129) and next prime (21113023033133).
It is not a de Polignac number, because 21113023033131 - 21 = 21113023033129 is a prime.
It is a super-2 number, since 2×211130230331312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21113023033133) 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, 4054726 + ... + 7659428.
It is an arithmetic number, because the mean of its divisors is an integer number (1763255380416).
Almost surely, 221113023033131 is an apocalyptic number.
21113023033131 is a deficient number, since it is larger than the sum of its proper divisors (7099063053525).
21113023033131 is a wasteful number, since it uses less digits than its factorization.
21113023033131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3608962.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 21113023033131 its reverse (13133032031112), we get a palindrome (34246055064243).
The spelling of 21113023033131 in words is "twenty-one trillion, one hundred thirteen billion, twenty-three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •