Base | Representation |
---|---|
bin | 1001010100101100100001… |
… | …11101101110000001101111 |
3 | 2200121000001022020021222012 |
4 | 10222112100331232001233 |
5 | 10141402213104032343 |
6 | 111334344234111435 |
7 | 4214146244055131 |
oct | 452262075560157 |
9 | 80530038207865 |
10 | 20502311002223 |
11 | 6594a88080726 |
12 | 237159a57b57b |
13 | b5948a15973b |
14 | 50c462375051 |
15 | 2584a3810718 |
hex | 12a590f6e06f |
20502311002223 has 4 divisors (see below), whose sum is σ = 21581380002360. Its totient is φ = 19423242002088.
The previous prime is 20502311002171. The next prime is 20502311002273. The reversal of 20502311002223 is 32220011320502.
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 20502311002223 - 232 = 20498016034927 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 (20502311002273) 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, 539534500040 + ... + 539534500077.
It is an arithmetic number, because the mean of its divisors is an integer number (5395345000590).
Almost surely, 220502311002223 is an apocalyptic number.
20502311002223 is a deficient number, since it is larger than the sum of its proper divisors (1079069000137).
20502311002223 is a wasteful number, since it uses less digits than its factorization.
20502311002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1079069000136.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 20502311002223 its reverse (32220011320502), we get a palindrome (52722322322725).
The spelling of 20502311002223 in words is "twenty trillion, five hundred two billion, three hundred eleven million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •