Base | Representation |
---|---|
bin | 111000110101000110… |
… | …1100110000101000111 |
3 | 102200000020201211110102 |
4 | 1301222031212011013 |
5 | 3444420001024111 |
6 | 132022002514315 |
7 | 11550201444011 |
oct | 1615215460507 |
9 | 380006654412 |
10 | 122041033031 |
11 | 47836a88485 |
12 | 1b79b36599b |
13 | b67bcca518 |
14 | 5c9a4431b1 |
15 | 329427113b |
hex | 1c6a366147 |
122041033031 has 4 divisors (see below), whose sum is σ = 122715293064. Its totient is φ = 121366773000.
The previous prime is 122041033013. The next prime is 122041033039. The reversal of 122041033031 is 130330140221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122041033031 is a prime.
It is a super-2 number, since 2×1220410330312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122041032994 and 122041033012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122041033039) 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, 337129745 + ... + 337130106.
It is an arithmetic number, because the mean of its divisors is an integer number (30678823266).
Almost surely, 2122041033031 is an apocalyptic number.
122041033031 is a deficient number, since it is larger than the sum of its proper divisors (674260033).
122041033031 is an equidigital number, since it uses as much as digits as its factorization.
122041033031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674260032.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 122041033031 its reverse (130330140221), we get a palindrome (252371173252).
The spelling of 122041033031 in words is "one hundred twenty-two billion, forty-one million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •