Base | Representation |
---|---|
bin | 1001001111001010000011… |
… | …00111001011011010111111 |
3 | 2122220210211021122012212111 |
4 | 10213211001213023122333 |
5 | 10130242434242212343 |
6 | 111111112101114451 |
7 | 4164331215625033 |
oct | 447450147133277 |
9 | 78823737565774 |
10 | 20312001132223 |
11 | 65212a9119629 |
12 | 23407280b8a27 |
13 | b4454b5825c8 |
14 | 50316b1d41c3 |
15 | 253565e3ac9d |
hex | 1279419cb6bf |
20312001132223 has 4 divisors (see below), whose sum is σ = 20373366694888. Its totient is φ = 20250635569560.
The previous prime is 20312001132169. The next prime is 20312001132301. The reversal of 20312001132223 is 32223110021302.
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 20312001132223 - 221 = 20311999035071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20312001132194 and 20312001132203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20312001432223) 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, 30682780836 + ... + 30682781497.
It is an arithmetic number, because the mean of its divisors is an integer number (5093341673722).
Almost surely, 220312001132223 is an apocalyptic number.
20312001132223 is a deficient number, since it is larger than the sum of its proper divisors (61365562665).
20312001132223 is an equidigital number, since it uses as much as digits as its factorization.
20312001132223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61365562664.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 20312001132223 its reverse (32223110021302), we get a palindrome (52535111153525).
The spelling of 20312001132223 in words is "twenty trillion, three hundred twelve billion, one million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •