Base | Representation |
---|---|
bin | 11011110001000110000100… |
… | …101011000100101100011111 |
3 | 121000101122201121211021202101 |
4 | 123301012010223010230133 |
5 | 112001312332414323403 |
6 | 1111421343244305531 |
7 | 34502644664255005 |
oct | 3361060453045437 |
9 | 530348647737671 |
10 | 122121031011103 |
11 | 35a03269354003 |
12 | 11843a5a2422a7 |
13 | 531ac6b652837 |
14 | 2222991b66a75 |
15 | e1b9acd9371d |
hex | 6f1184ac4b1f |
122121031011103 has 12 divisors (see below), whose sum is σ = 128077329320248. Its totient is φ = 116430927584400.
The previous prime is 122121031011059. The next prime is 122121031011169. The reversal of 122121031011103 is 301110130121221.
It is a de Polignac number, because none of the positive numbers 2k-122121031011103 is a prime.
It is a super-2 number, since 2×1221210310111032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122121031011173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 375819048 + ... + 376143853.
Almost surely, 2122121031011103 is an apocalyptic number.
122121031011103 is a deficient number, since it is larger than the sum of its proper divisors (5956298309145).
122121031011103 is an equidigital number, since it uses as much as digits as its factorization.
122121031011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751963254 (or 751963231 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 122121031011103 its reverse (301110130121221), we get a palindrome (423231161132324).
The spelling of 122121031011103 in words is "one hundred twenty-two trillion, one hundred twenty-one billion, thirty-one million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •