Base | Representation |
---|---|
bin | 11101011011001111001… |
… | …001111111100001001101 |
3 | 21011022102022221221120000 |
4 | 131123033021333201031 |
5 | 231112240143213201 |
6 | 4144540005514513 |
7 | 266043526346130 |
oct | 35331711774115 |
9 | 7138368857500 |
10 | 2022110132301 |
11 | 70a6324a94a6 |
12 | 287a94712a39 |
13 | 1188b81669ac |
14 | 6dc290dc217 |
15 | 378ee112d86 |
hex | 1d6cf27f84d |
2022110132301 has 40 divisors (see below), whose sum is σ = 3477407926080. Its totient is φ = 1147057215552.
The previous prime is 2022110132293. The next prime is 2022110132323. The reversal of 2022110132301 is 1032310112202.
2022110132301 is a `hidden beast` number, since 2 + 0 + 221 + 10 + 132 + 301 = 666.
It is not a de Polignac number, because 2022110132301 - 23 = 2022110132293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022110132101) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 12938131 + ... + 13093488.
It is an arithmetic number, because the mean of its divisors is an integer number (86935198152).
Almost surely, 22022110132301 is an apocalyptic number.
2022110132301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2022110132301 is a deficient number, since it is larger than the sum of its proper divisors (1455297793779).
2022110132301 is a wasteful number, since it uses less digits than its factorization.
2022110132301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26031775 (or 26031766 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2022110132301 its reverse (1032310112202), we get a palindrome (3054420244503).
The spelling of 2022110132301 in words is "two trillion, twenty-two billion, one hundred ten million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •