Base | Representation |
---|---|
bin | 1101100110110… |
… | …11101100110101 |
3 | 21221210020000101 |
4 | 12303123230311 |
5 | 213210133401 |
6 | 15154314101 |
7 | 2554140316 |
oct | 663335465 |
9 | 257706011 |
10 | 114146101 |
11 | 59483723 |
12 | 32288931 |
13 | 1a857594 |
14 | 1123460d |
15 | a04b101 |
hex | 6cdbb35 |
114146101 has 2 divisors, whose sum is σ = 114146102. Its totient is φ = 114146100.
The previous prime is 114146099. The next prime is 114146111. The reversal of 114146101 is 101641411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67223601 + 46922500 = 8199^2 + 6850^2 .
It is an emirp because it is prime and its reverse (101641411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114146101 - 21 = 114146099 is a prime.
Together with 114146099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114146111) 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, 57073050 + 57073051.
It is an arithmetic number, because the mean of its divisors is an integer number (57073051).
Almost surely, 2114146101 is an apocalyptic number.
It is an amenable number.
114146101 is a deficient number, since it is larger than the sum of its proper divisors (1).
114146101 is an equidigital number, since it uses as much as digits as its factorization.
114146101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
The square root of 114146101 is about 10683.9178675241. The cubic root of 114146101 is about 485.0878092331.
Adding to 114146101 its reverse (101641411), we get a palindrome (215787512).
The spelling of 114146101 in words is "one hundred fourteen million, one hundred forty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •