Base | Representation |
---|---|
bin | 1001000110101110010011… |
… | …11101111110001000000001 |
3 | 2121220002212201001221220012 |
4 | 10203113021331332020001 |
5 | 10111021012121013241 |
6 | 110330030322154305 |
7 | 4134362356463120 |
oct | 443271175761001 |
9 | 77802781057805 |
10 | 20022231032321 |
11 | 641a420491721 |
12 | 22b45387b2995 |
13 | b2311bc66b2b |
14 | 4d311c97bab7 |
15 | 24ac568ed6eb |
hex | 1235c9f7e201 |
20022231032321 has 4 divisors (see below), whose sum is σ = 22882549751232. Its totient is φ = 17161912313412.
The previous prime is 20022231032273. The next prime is 20022231032351. The reversal of 20022231032321 is 12323013222002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20022231032321 - 214 = 20022231015937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20022231032351) 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, 1430159359445 + ... + 1430159359458.
It is an arithmetic number, because the mean of its divisors is an integer number (5720637437808).
Almost surely, 220022231032321 is an apocalyptic number.
It is an amenable number.
20022231032321 is a deficient number, since it is larger than the sum of its proper divisors (2860318718911).
20022231032321 is an equidigital number, since it uses as much as digits as its factorization.
20022231032321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2860318718910.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20022231032321 its reverse (12323013222002), we get a palindrome (32345244254323).
The spelling of 20022231032321 in words is "twenty trillion, twenty-two billion, two hundred thirty-one million, thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •