Base | Representation |
---|---|
bin | 11101011100000101100… |
… | …000100100111010110001 |
3 | 21011101202212211202111110 |
4 | 131130011200210322301 |
5 | 231121122114203241 |
6 | 4145210302503533 |
7 | 266105241315456 |
oct | 35340540447261 |
9 | 7141685752443 |
10 | 2023022022321 |
11 | 70aa60211a13 |
12 | 2880a9b94ba9 |
13 | 118a020642a1 |
14 | 6dcb427182d |
15 | 379541dc816 |
hex | 1d705824eb1 |
2023022022321 has 4 divisors (see below), whose sum is σ = 2697362696432. Its totient is φ = 1348681348212.
The previous prime is 2023022022223. The next prime is 2023022022323. The reversal of 2023022022321 is 1232202203202.
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 not a de Polignac number, because 2023022022321 - 210 = 2023022021297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2023022022323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 337170337051 + ... + 337170337056.
It is an arithmetic number, because the mean of its divisors is an integer number (674340674108).
Almost surely, 22023022022321 is an apocalyptic number.
It is an amenable number.
2023022022321 is a deficient number, since it is larger than the sum of its proper divisors (674340674111).
2023022022321 is an equidigital number, since it uses as much as digits as its factorization.
2023022022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674340674110.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 2023022022321 its reverse (1232202203202), we get a palindrome (3255224225523).
The spelling of 2023022022321 in words is "two trillion, twenty-three billion, twenty-two million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •