Base | Representation |
---|---|
bin | 111100010000101… |
… | …0111000111000011 |
3 | 12012220202211002120 |
4 | 1320201113013003 |
5 | 13120113330311 |
6 | 532350415323 |
7 | 101051545524 |
oct | 17041270703 |
9 | 5186684076 |
10 | 2022011331 |
11 | 94841104a |
12 | 485201543 |
13 | 262bb3112 |
14 | 15278884b |
15 | bc7ae706 |
hex | 788571c3 |
2022011331 has 48 divisors (see below), whose sum is σ = 3040920960. Its totient is φ = 1191490560.
The previous prime is 2022011287. The next prime is 2022011401. The reversal of 2022011331 is 1331102202.
It is not a de Polignac number, because 2022011331 - 222 = 2017817027 is a prime.
It is a super-4 number, since 4×20220113314 (a number of 38 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3, 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2022011331.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022011531) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2157495 + ... + 2158431.
It is an arithmetic number, because the mean of its divisors is an integer number (63352520).
Almost surely, 22022011331 is an apocalyptic number.
2022011331 is a deficient number, since it is larger than the sum of its proper divisors (1018909629).
2022011331 is a wasteful number, since it uses less digits than its factorization.
2022011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1124 (or 1107 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2022011331 is about 44966.7803050207. The cubic root of 2022011331 is about 1264.5262863015.
Adding to 2022011331 its reverse (1331102202), we get a palindrome (3353113533).
The spelling of 2022011331 in words is "two billion, twenty-two million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •