Base | Representation |
---|---|
bin | 1001101100010010100111… |
… | …10000110101001000011111 |
3 | 2210110111122220202121001001 |
4 | 10312021103300311020133 |
5 | 10243143042424012343 |
6 | 113155023332531131 |
7 | 4326546553445632 |
oct | 466112360651037 |
9 | 83414586677031 |
10 | 21313033032223 |
11 | 6877896576239 |
12 | 2482737780aa7 |
13 | bb7a6c57705a |
14 | 5397b06cdc19 |
15 | 26e60308544d |
hex | 136253c3521f |
21313033032223 has 4 divisors (see below), whose sum is σ = 21313316778088. Its totient is φ = 21312749286360.
The previous prime is 21313033032173. The next prime is 21313033032227. The reversal of 21313033032223 is 32223033031312.
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 21313033032223 - 233 = 21304443097631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21313033032191 and 21313033032200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21313033032227) 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, 141760233 + ... + 141910498.
It is an arithmetic number, because the mean of its divisors is an integer number (5328329194522).
Almost surely, 221313033032223 is an apocalyptic number.
21313033032223 is a deficient number, since it is larger than the sum of its proper divisors (283745865).
21313033032223 is an equidigital number, since it uses as much as digits as its factorization.
21313033032223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283745864.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 21313033032223 its reverse (32223033031312), we get a palindrome (53536066063535).
The spelling of 21313033032223 in words is "twenty-one trillion, three hundred thirteen billion, thirty-three million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •