Base | Representation |
---|---|
bin | 110101010010011010… |
… | …0101110000001001101 |
3 | 101221101010120112000002 |
4 | 1222210310232001031 |
5 | 3333330203324401 |
6 | 124323115014045 |
7 | 11160535426562 |
oct | 1524464560115 |
9 | 357333515002 |
10 | 114434433101 |
11 | 4459328835a |
12 | 1a217a3a325 |
13 | aa39127911 |
14 | 5778102869 |
15 | 2e9b583a6b |
hex | 1aa4d2e04d |
114434433101 has 2 divisors, whose sum is σ = 114434433102. Its totient is φ = 114434433100.
The previous prime is 114434433079. The next prime is 114434433103. The reversal of 114434433101 is 101334434411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90556457476 + 23877975625 = 300926^2 + 154525^2 .
It is a cyclic number.
It is not a de Polignac number, because 114434433101 - 230 = 113360691277 is a prime.
Together with 114434433103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114434433103) 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, 57217216550 + 57217216551.
It is an arithmetic number, because the mean of its divisors is an integer number (57217216551).
Almost surely, 2114434433101 is an apocalyptic number.
It is an amenable number.
114434433101 is a deficient number, since it is larger than the sum of its proper divisors (1).
114434433101 is an equidigital number, since it uses as much as digits as its factorization.
114434433101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 114434433101 its reverse (101334434411), we get a palindrome (215768867512).
The spelling of 114434433101 in words is "one hundred fourteen billion, four hundred thirty-four million, four hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •