Base | Representation |
---|---|
bin | 110000000011010011100000… |
… | …001000101111011000110111 |
3 | 1000201021021021012210011210102 |
4 | 300003103200020233120313 |
5 | 210144441130243020043 |
6 | 2025245105253544315 |
7 | 62341220646234215 |
oct | 6003234010573067 |
9 | 1021237235704712 |
10 | 211333331220023 |
11 | 61378a65030491 |
12 | 1b85199504509b |
13 | 90bc855a9a31c |
14 | 3a28832d2bcb5 |
15 | 19673e91ee6b8 |
hex | c034e022f637 |
211333331220023 has 16 divisors (see below), whose sum is σ = 222531171012480. Its totient is φ = 200143006316064.
The previous prime is 211333331220017. The next prime is 211333331220059. The reversal of 211333331220023 is 320022133333112.
It is a cyclic number.
It is not a de Polignac number, because 211333331220023 - 24 = 211333331220007 is a prime.
It is a super-2 number, since 2×2113333312200232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211333331220013) 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, 681031340 + ... + 681341582.
It is an arithmetic number, because the mean of its divisors is an integer number (13908198188280).
Almost surely, 2211333331220023 is an apocalyptic number.
211333331220023 is a deficient number, since it is larger than the sum of its proper divisors (11197839792457).
211333331220023 is a wasteful number, since it uses less digits than its factorization.
211333331220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322238.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 211333331220023 its reverse (320022133333112), we get a palindrome (531355464553135).
The spelling of 211333331220023 in words is "two hundred eleven trillion, three hundred thirty-three billion, three hundred thirty-one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •