Base | Representation |
---|---|
bin | 110101001000100010… |
… | …1001101110100100101 |
3 | 101220112001022210220212 |
4 | 1222101011031310211 |
5 | 3332140410311344 |
6 | 124230203505205 |
7 | 11146404211406 |
oct | 1522105156445 |
9 | 356461283825 |
10 | 114103213349 |
11 | 44433320024 |
12 | 1a144b28205 |
13 | a9b56188b8 |
14 | 57461239ad |
15 | 2e7c45979e |
hex | 1a9114dd25 |
114103213349 has 2 divisors, whose sum is σ = 114103213350. Its totient is φ = 114103213348.
The previous prime is 114103213319. The next prime is 114103213381. The reversal of 114103213349 is 943312301411.
It is an a-pointer prime, because the next prime (114103213381) can be obtained adding 114103213349 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109885620100 + 4217593249 = 331490^2 + 64943^2 .
It is a cyclic number.
It is not a de Polignac number, because 114103213349 - 220 = 114102164773 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114103213319) 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 as a sum of consecutive naturals, namely, 57051606674 + 57051606675.
It is an arithmetic number, because the mean of its divisors is an integer number (57051606675).
Almost surely, 2114103213349 is an apocalyptic number.
It is an amenable number.
114103213349 is a deficient number, since it is larger than the sum of its proper divisors (1).
114103213349 is an equidigital number, since it uses as much as digits as its factorization.
114103213349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
The spelling of 114103213349 in words is "one hundred fourteen billion, one hundred three million, two hundred thirteen thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •