Base | Representation |
---|---|
bin | 1001100110011110011001… |
… | …10110001000001100000111 |
3 | 2202202101212021112121200201 |
4 | 10303033030312020030013 |
5 | 10231404313424014343 |
6 | 112523134242551331 |
7 | 4306243542301312 |
oct | 463171466101407 |
9 | 82671767477621 |
10 | 21113201001223 |
11 | 68000705aa6a1 |
12 | 244ba68368547 |
13 | ba1c73ca8926 |
14 | 52dc54a53979 |
15 | 26930973e94d |
hex | 1333ccd88307 |
21113201001223 has 4 divisors (see below), whose sum is σ = 21118865936800. Its totient is φ = 21107536065648.
The previous prime is 21113201001197. The next prime is 21113201001227. The reversal of 21113201001223 is 32210010231112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21113201001223 - 233 = 21104611066631 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21113201001223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113201001227) 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, 2832462198 + ... + 2832469651.
It is an arithmetic number, because the mean of its divisors is an integer number (5279716484200).
Almost surely, 221113201001223 is an apocalyptic number.
21113201001223 is a deficient number, since it is larger than the sum of its proper divisors (5664935577).
21113201001223 is an equidigital number, since it uses as much as digits as its factorization.
21113201001223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5664935576.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21113201001223 its reverse (32210010231112), we get a palindrome (53323211232335).
The spelling of 21113201001223 in words is "twenty-one trillion, one hundred thirteen billion, two hundred one million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •