Base | Representation |
---|---|
bin | 1001001110110111101001… |
… | …10010100000000010010111 |
3 | 2122212212022210220120011011 |
4 | 10213123310302200002113 |
5 | 10130112221303220043 |
6 | 111102355523553051 |
7 | 4163531342252215 |
oct | 447336462400227 |
9 | 78785283816134 |
10 | 20302122320023 |
11 | 6518099857825 |
12 | 233a82b82b787 |
13 | b43635a168bb |
14 | 5028b11b9cb5 |
15 | 253188a1a59d |
hex | 1276f4ca0097 |
20302122320023 has 8 divisors (see below), whose sum is σ = 20506107661200. Its totient is φ = 20098964506368.
The previous prime is 20302122319937. The next prime is 20302122320069. The reversal of 20302122320023 is 32002322120302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20302122320023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20302122319976 and 20302122320003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20302122323023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206832568 + ... + 206930701.
It is an arithmetic number, because the mean of its divisors is an integer number (2563263457650).
Almost surely, 220302122320023 is an apocalyptic number.
20302122320023 is a deficient number, since it is larger than the sum of its proper divisors (203985341177).
20302122320023 is a wasteful number, since it uses less digits than its factorization.
20302122320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413763761.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 20302122320023 its reverse (32002322120302), we get a palindrome (52304444440325).
The spelling of 20302122320023 in words is "twenty trillion, three hundred two billion, one hundred twenty-two million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •