Base | Representation |
---|---|
bin | 1010000000101011000000… |
… | …10011110100111011111111 |
3 | 2212221110020100021011021222 |
4 | 11000111200103310323333 |
5 | 10341131241214433203 |
6 | 114452440413343555 |
7 | 4431260445621236 |
oct | 500254023647377 |
9 | 85843210234258 |
10 | 22013323202303 |
11 | 7017886074a14 |
12 | 25763b5497bbb |
13 | c38b02b7c764 |
14 | 561644369b1d |
15 | 28293c859038 |
hex | 1405604f4eff |
22013323202303 has 4 divisors (see below), whose sum is σ = 22013344785168. Its totient is φ = 22013301619440.
The previous prime is 22013323202293. The next prime is 22013323202363. The reversal of 22013323202303 is 30320232331022.
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 22013323202303 - 216 = 22013323136767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22013323202363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9181451 + ... + 11328092.
It is an arithmetic number, because the mean of its divisors is an integer number (5503336196292).
Almost surely, 222013323202303 is an apocalyptic number.
22013323202303 is a deficient number, since it is larger than the sum of its proper divisors (21582865).
22013323202303 is a wasteful number, since it uses less digits than its factorization.
22013323202303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21582864.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 22013323202303 its reverse (30320232331022), we get a palindrome (52333555533325).
The spelling of 22013323202303 in words is "twenty-two trillion, thirteen billion, three hundred twenty-three million, two hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •