Base | Representation |
---|---|
bin | 1001100110011010010011… |
… | …10110100110110000010011 |
3 | 2202202012012010012101122002 |
4 | 10303031021312212300103 |
5 | 10231340313321423443 |
6 | 112522132214504215 |
7 | 4306135225242455 |
oct | 463151166466023 |
9 | 82665163171562 |
10 | 21111003311123 |
11 | 67aa143008590 |
12 | 244b55436506b |
13 | ba19b38a579b |
14 | 52dac6c182d5 |
15 | 26922b82c2b8 |
hex | 133349da6c13 |
21111003311123 has 16 divisors (see below), whose sum is σ = 23495551781472. Its totient is φ = 18804967584000.
The previous prime is 21111003311087. The next prime is 21111003311129. The reversal of 21111003311123 is 32111330011112.
It is a cyclic number.
It is not a de Polignac number, because 21111003311123 - 26 = 21111003311059 is a prime.
It is a super-2 number, since 2×211110033111232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21111003311095 and 21111003311104.
It is not an unprimeable number, because it can be changed into a prime (21111003311129) 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, 23348048 + ... + 24235373.
It is an arithmetic number, because the mean of its divisors is an integer number (1468471986342).
Almost surely, 221111003311123 is an apocalyptic number.
21111003311123 is a deficient number, since it is larger than the sum of its proper divisors (2384548470349).
21111003311123 is a wasteful number, since it uses less digits than its factorization.
21111003311123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47584246.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 21111003311123 its reverse (32111330011112), we get a palindrome (53222333322235).
The spelling of 21111003311123 in words is "twenty-one trillion, one hundred eleven billion, three million, three hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •