Base | Representation |
---|---|
bin | 11101011011001001011… |
… | …000101100011100000101 |
3 | 21011022011120210112011211 |
4 | 131123021120230130011 |
5 | 231112040402314023 |
6 | 4144522230531421 |
7 | 266041242443245 |
oct | 35331130543405 |
9 | 7138146715154 |
10 | 2022013323013 |
11 | 70a592897222 |
12 | 287a68206b71 |
13 | 1188a109c5a8 |
14 | 6dc1a2dbb25 |
15 | 378e588da0d |
hex | 1d6c962c705 |
2022013323013 has 4 divisors (see below), whose sum is σ = 2022311517868. Its totient is φ = 2021715128160.
The previous prime is 2022013322999. The next prime is 2022013323023. The reversal of 2022013323013 is 3103233102202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 783972118084 + 1238041204929 = 885422^2 + 1112673^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022013323013 - 25 = 2022013322981 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 (2022013323023) 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, 149087256 + ... + 149100817.
It is an arithmetic number, because the mean of its divisors is an integer number (505577879467).
Almost surely, 22022013323013 is an apocalyptic number.
It is an amenable number.
2022013323013 is a deficient number, since it is larger than the sum of its proper divisors (298194855).
2022013323013 is an equidigital number, since it uses as much as digits as its factorization.
2022013323013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 298194854.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2022013323013 its reverse (3103233102202), we get a palindrome (5125246425215).
The spelling of 2022013323013 in words is "two trillion, twenty-two billion, thirteen million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •