Base | Representation |
---|---|
bin | 1001100011110111000000… |
… | …10100001011100001111001 |
3 | 2202102210220020200001210111 |
4 | 10301323200110023201321 |
5 | 10223421241313124423 |
6 | 112413552550544321 |
7 | 4266612540600106 |
oct | 461734024134171 |
9 | 82383806601714 |
10 | 21023333333113 |
11 | 6775a44653501 |
12 | 24365679680a1 |
13 | b9665170a657 |
14 | 52976b561aad |
15 | 266ce9d0260d |
hex | 131ee050b879 |
21023333333113 has 4 divisors (see below), whose sum is σ = 21061767215440. Its totient is φ = 20984899450788.
The previous prime is 21023333333099. The next prime is 21023333333131. The reversal of 21023333333113 is 31133333332012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21023333333113 - 29 = 21023333332601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21023333333153) 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, 19216940343 + ... + 19216941436.
It is an arithmetic number, because the mean of its divisors is an integer number (5265441803860).
Almost surely, 221023333333113 is an apocalyptic number.
It is an amenable number.
21023333333113 is a deficient number, since it is larger than the sum of its proper divisors (38433882327).
21023333333113 is an equidigital number, since it uses as much as digits as its factorization.
21023333333113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38433882326.
The product of its (nonzero) digits is 26244, while the sum is 31.
Adding to 21023333333113 its reverse (31133333332012), we get a palindrome (52156666665125).
The spelling of 21023333333113 in words is "twenty-one trillion, twenty-three billion, three hundred thirty-three million, three hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •