Base | Representation |
---|---|
bin | 111100100010000… |
… | …0111001001111110 |
3 | 12020112220122020112 |
4 | 1321010013021332 |
5 | 13124431333042 |
6 | 533313550022 |
7 | 101222146430 |
oct | 17104071176 |
9 | 5215818215 |
10 | 2031121022 |
11 | 952573317 |
12 | 488275312 |
13 | 264a52678 |
14 | 153a7a650 |
15 | bd4ad982 |
hex | 7910727e |
2031121022 has 8 divisors (see below), whose sum is σ = 3481921776. Its totient is φ = 870480432.
The previous prime is 2031121021. The next prime is 2031121051. The reversal of 2031121022 is 2201211302.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 145080073 = 2031121022 / (2 + 0 + 3 + 1 + 1 + 2 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2031120988 and 2031121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2031121021) 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, 72540023 + ... + 72540050.
It is an arithmetic number, because the mean of its divisors is an integer number (435240222).
Almost surely, 22031121022 is an apocalyptic number.
2031121022 is a deficient number, since it is larger than the sum of its proper divisors (1450800754).
2031121022 is a wasteful number, since it uses less digits than its factorization.
2031121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145080082.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2031121022 is about 45067.9600381468. The cubic root of 2031121022 is about 1266.4224490235.
Adding to 2031121022 its reverse (2201211302), we get a palindrome (4232332324).
The spelling of 2031121022 in words is "two billion, thirty-one million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •