Base | Representation |
---|---|
bin | 110101001100011000… |
… | …1001110111101010001 |
3 | 101220212001000122112101 |
4 | 1222120301032331101 |
5 | 3332421420132344 |
6 | 124251052200401 |
7 | 11152531422055 |
oct | 1523061167521 |
9 | 356761018471 |
10 | 114232192849 |
11 | 4449a105255 |
12 | 1a180169101 |
13 | aa06267a28 |
14 | 57592d9c65 |
15 | 2e889359d4 |
hex | 1a98c4ef51 |
114232192849 has 2 divisors, whose sum is σ = 114232192850. Its totient is φ = 114232192848.
The previous prime is 114232192819. The next prime is 114232192861. The reversal of 114232192849 is 948291232411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88665781824 + 25566411025 = 297768^2 + 159895^2 .
It is a cyclic number.
It is not a de Polignac number, because 114232192849 - 27 = 114232192721 is a prime.
It is a super-2 number, since 2×1142321928492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114232192799 and 114232192808.
It is not a weakly prime, because it can be changed into another prime (114232192819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57116096424 + 57116096425.
It is an arithmetic number, because the mean of its divisors is an integer number (57116096425).
Almost surely, 2114232192849 is an apocalyptic number.
It is an amenable number.
114232192849 is a deficient number, since it is larger than the sum of its proper divisors (1).
114232192849 is an equidigital number, since it uses as much as digits as its factorization.
114232192849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 248832, while the sum is 46.
The spelling of 114232192849 in words is "one hundred fourteen billion, two hundred thirty-two million, one hundred ninety-two thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •