Base | Representation |
---|---|
bin | 11101011011010000011… |
… | …110101010111001110111 |
3 | 21011022110212201201012211 |
4 | 131123100132222321313 |
5 | 231112311334030403 |
6 | 4144542121354251 |
7 | 266044216130554 |
oct | 35332036527167 |
9 | 7138425651184 |
10 | 2022132330103 |
11 | 70a643a8aa96 |
12 | 287aa0038987 |
13 | 1188bc9395a2 |
14 | 6dc2c039a2b |
15 | 3790104a06d |
hex | 1d6d07aae77 |
2022132330103 has 8 divisors (see below), whose sum is σ = 2117560212576. Its totient is φ = 1927330204800.
The previous prime is 2022132330083. The next prime is 2022132330161. The reversal of 2022132330103 is 3010332312202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2022132330103 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 (2022132330203) 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, 156432678 + ... + 156445603.
It is an arithmetic number, because the mean of its divisors is an integer number (264695026572).
Almost surely, 22022132330103 is an apocalyptic number.
2022132330103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2022132330103 is a deficient number, since it is larger than the sum of its proper divisors (95427882473).
2022132330103 is a wasteful number, since it uses less digits than its factorization.
2022132330103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312878585.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2022132330103 its reverse (3010332312202), we get a palindrome (5032464642305).
The spelling of 2022132330103 in words is "two trillion, twenty-two billion, one hundred thirty-two million, three hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •