Base | Representation |
---|---|
bin | 111000111101011101… |
… | …0110011110010001111 |
3 | 102200201210010221102010 |
4 | 1301322322303302033 |
5 | 4001003224233403 |
6 | 132105454232303 |
7 | 11560144034262 |
oct | 1617272636217 |
9 | 380653127363 |
10 | 122321321103 |
11 | 47970219013 |
12 | 1b8591b5693 |
13 | b6c50b6057 |
14 | 5cc5764cd9 |
15 | 32adb89603 |
hex | 1c7aeb3c8f |
122321321103 has 4 divisors (see below), whose sum is σ = 163095094808. Its totient is φ = 81547547400.
The previous prime is 122321321069. The next prime is 122321321113. The reversal of 122321321103 is 301123123221.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 122321321103 - 214 = 122321304719 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122321321103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122321321113) 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 3 ways as a sum of consecutive naturals, for example, 20386886848 + ... + 20386886853.
It is an arithmetic number, because the mean of its divisors is an integer number (40773773702).
Almost surely, 2122321321103 is an apocalyptic number.
122321321103 is a deficient number, since it is larger than the sum of its proper divisors (40773773705).
122321321103 is an equidigital number, since it uses as much as digits as its factorization.
122321321103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40773773704.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 122321321103 its reverse (301123123221), we get a palindrome (423444444324).
The spelling of 122321321103 in words is "one hundred twenty-two billion, three hundred twenty-one million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •