Base | Representation |
---|---|
bin | 1001100110011010101111… |
… | …00000010000010101000011 |
3 | 2202202012210002010220202101 |
4 | 10303031113200100111003 |
5 | 10231341300434124443 |
6 | 112522211035331231 |
7 | 4306144006013212 |
oct | 463152740202503 |
9 | 82665702126671 |
10 | 21111232333123 |
11 | 67aa250313169 |
12 | 244b5b8bb0b17 |
13 | ba1a1c18186a |
14 | 52db093d3079 |
15 | 2692419ba84d |
hex | 133357810543 |
21111232333123 has 32 divisors (see below), whose sum is σ = 22392579686400. Its totient is φ = 19847341345824.
The previous prime is 21111232333063. The next prime is 21111232333151. The reversal of 21111232333123 is 32133323211112.
It is a cyclic number.
It is not a de Polignac number, because 21111232333123 - 217 = 21111232202051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21111232333091 and 21111232333100.
It is not an unprimeable number, because it can be changed into a prime (21111232333183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7629645286 + ... + 7629648052.
It is an arithmetic number, because the mean of its divisors is an integer number (699768115200).
Almost surely, 221111232333123 is an apocalyptic number.
21111232333123 is a deficient number, since it is larger than the sum of its proper divisors (1281347353277).
21111232333123 is a wasteful number, since it uses less digits than its factorization.
21111232333123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6079.
The product of its digits is 3888, while the sum is 28.
Adding to 21111232333123 its reverse (32133323211112), we get a palindrome (53244555544235).
The spelling of 21111232333123 in words is "twenty-one trillion, one hundred eleven billion, two hundred thirty-two million, three hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •