Base | Representation |
---|---|
bin | 110101001001101111… |
… | …1001101001101111011 |
3 | 101220121212021200222221 |
4 | 1222103133031031323 |
5 | 3332231224043201 |
6 | 124234205024511 |
7 | 11150404300453 |
oct | 1522337151573 |
9 | 356555250887 |
10 | 114143581051 |
11 | 44454091965 |
12 | 1a156555137 |
13 | a9c0ab0906 |
14 | 574b630d63 |
15 | 2e80c804a1 |
hex | 1a937cd37b |
114143581051 has 2 divisors, whose sum is σ = 114143581052. Its totient is φ = 114143581050.
The previous prime is 114143580997. The next prime is 114143581061. The reversal of 114143581051 is 150185341411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114143581051 - 227 = 114009363323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114143580998 and 114143581016.
It is not a weakly prime, because it can be changed into another prime (114143581061) 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 as a sum of consecutive naturals, namely, 57071790525 + 57071790526.
It is an arithmetic number, because the mean of its divisors is an integer number (57071790526).
Almost surely, 2114143581051 is an apocalyptic number.
114143581051 is a deficient number, since it is larger than the sum of its proper divisors (1).
114143581051 is an equidigital number, since it uses as much as digits as its factorization.
114143581051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 34.
The spelling of 114143581051 in words is "one hundred fourteen billion, one hundred forty-three million, five hundred eighty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •