Base | Representation |
---|---|
bin | 111001000001010001… |
… | …0001111100001001111 |
3 | 102201001200120201111120 |
4 | 1302002202033201033 |
5 | 4001233432130311 |
6 | 132130301052023 |
7 | 11563255111143 |
oct | 1620242174117 |
9 | 381050521446 |
10 | 122449098831 |
11 | 47a26362344 |
12 | 1b893b57013 |
13 | b715704187 |
14 | 5cd8707223 |
15 | 32b9ec9706 |
hex | 1c8288f84f |
122449098831 has 4 divisors (see below), whose sum is σ = 163265465112. Its totient is φ = 81632732552.
The previous prime is 122449098797. The next prime is 122449098833. The reversal of 122449098831 is 138890944221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 138890944221 = 3 ⋅46296981407.
It is a cyclic number.
It is not a de Polignac number, because 122449098831 - 214 = 122449082447 is a prime.
It is a super-2 number, since 2×1224490988312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122449098833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20408183136 + ... + 20408183141.
It is an arithmetic number, because the mean of its divisors is an integer number (40816366278).
Almost surely, 2122449098831 is an apocalyptic number.
122449098831 is a deficient number, since it is larger than the sum of its proper divisors (40816366281).
122449098831 is an equidigital number, since it uses as much as digits as its factorization.
122449098831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40816366280.
The product of its (nonzero) digits is 995328, while the sum is 51.
The spelling of 122449098831 in words is "one hundred twenty-two billion, four hundred forty-nine million, ninety-eight thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •