Base | Representation |
---|---|
bin | 11101011011011011110… |
… | …010001111011110110001 |
3 | 21011022222002122110011102 |
4 | 131123123302033132301 |
5 | 231113203413310113 |
6 | 4145013015054145 |
7 | 266052011313353 |
oct | 35333362173661 |
9 | 7138862573142 |
10 | 2022322010033 |
11 | 70a731064366 |
12 | 287b33671355 |
13 | 11892001c430 |
14 | 6dc492d30d3 |
15 | 37912a16758 |
hex | 1d6dbc8f7b1 |
2022322010033 has 8 divisors (see below), whose sum is σ = 2177897170176. Its totient is φ = 1866748554000.
The previous prime is 2022322009987. The next prime is 2022322010047. The reversal of 2022322010033 is 3300102232202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2022322010033 - 26 = 2022322009969 is a prime.
It is a super-2 number, since 2×20223220100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2022322009987 and 2022322010014.
It is not an unprimeable number, because it can be changed into a prime (2022322010333) 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, 3151358 + ... + 3738408.
It is an arithmetic number, because the mean of its divisors is an integer number (272237146272).
Almost surely, 22022322010033 is an apocalyptic number.
It is an amenable number.
2022322010033 is a deficient number, since it is larger than the sum of its proper divisors (155575160143).
2022322010033 is a wasteful number, since it uses less digits than its factorization.
2022322010033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 852055.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 2022322010033 its reverse (3300102232202), we get a palindrome (5322424242235).
The spelling of 2022322010033 in words is "two trillion, twenty-two billion, three hundred twenty-two million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •