Base | Representation |
---|---|
bin | 110101001000110100… |
… | …0000010010101011101 |
3 | 101220112200111120011122 |
4 | 1222101220002111131 |
5 | 3332200224410331 |
6 | 124231131300325 |
7 | 11146544616545 |
oct | 1522150022535 |
9 | 356480446148 |
10 | 114112341341 |
11 | 44438495019 |
12 | 1a147baa6a5 |
13 | a9b749358b |
14 | 574741c325 |
15 | 2e7d15e17b |
hex | 1a91a0255d |
114112341341 has 2 divisors, whose sum is σ = 114112341342. Its totient is φ = 114112341340.
The previous prime is 114112341323. The next prime is 114112341359. The reversal of 114112341341 is 143143211411.
It is a balanced prime because it is at equal distance from previous prime (114112341323) and next prime (114112341359).
It can be written as a sum of positive squares in only one way, i.e., 113670122500 + 442218841 = 337150^2 + 21029^2 .
It is a cyclic number.
It is not a de Polignac number, because 114112341341 - 218 = 114112079197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114112341341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114112341361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57056170670 + 57056170671.
It is an arithmetic number, because the mean of its divisors is an integer number (57056170671).
Almost surely, 2114112341341 is an apocalyptic number.
It is an amenable number.
114112341341 is a deficient number, since it is larger than the sum of its proper divisors (1).
114112341341 is an equidigital number, since it uses as much as digits as its factorization.
114112341341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152, while the sum is 26.
Adding to 114112341341 its reverse (143143211411), we get a palindrome (257255552752).
The spelling of 114112341341 in words is "one hundred fourteen billion, one hundred twelve million, three hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •