Base | Representation |
---|---|
bin | 111100010001001… |
… | …1101100110001001 |
3 | 12012221022111010112 |
4 | 1320202131212021 |
5 | 13120202100131 |
6 | 532400524105 |
7 | 101054160326 |
oct | 17042354611 |
9 | 5187274115 |
10 | 2022300041 |
11 | 948598a53 |
12 | 485320635 |
13 | 262c84658 |
14 | 152821b4d |
15 | bc81a02b |
hex | 7889d989 |
2022300041 has 4 divisors (see below), whose sum is σ = 2026804500. Its totient is φ = 2017795584.
The previous prime is 2022300013. The next prime is 2022300053. The reversal of 2022300041 is 1400032202.
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 546203641 + 1476096400 = 23371^2 + 38420^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022300041 - 26 = 2022299977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022299989 and 2022300025.
It is not an unprimeable number, because it can be changed into a prime (2022300011) 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, 2251556 + ... + 2252453.
It is an arithmetic number, because the mean of its divisors is an integer number (506701125).
Almost surely, 22022300041 is an apocalyptic number.
It is an amenable number.
2022300041 is a deficient number, since it is larger than the sum of its proper divisors (4504459).
2022300041 is an equidigital number, since it uses as much as digits as its factorization.
2022300041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4504458.
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 2022300041 is about 44969.9904491873. The cubic root of 2022300041 is about 1264.5864679639.
Adding to 2022300041 its reverse (1400032202), we get a palindrome (3422332243).
The spelling of 2022300041 in words is "two billion, twenty-two million, three hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •