Base | Representation |
---|---|
bin | 1101100101110… |
… | …10011111110101 |
3 | 21221112022110100 |
4 | 12302322133311 |
5 | 213141310401 |
6 | 15151344313 |
7 | 2553032652 |
oct | 662723765 |
9 | 257468410 |
10 | 114010101 |
11 | 593a0527 |
12 | 32222099 |
13 | 1a80a6ca |
14 | 111dac29 |
15 | a020b86 |
hex | 6cba7f5 |
114010101 has 6 divisors (see below), whose sum is σ = 164681270. Its totient is φ = 76006728.
The previous prime is 114010093. The next prime is 114010121. The reversal of 114010101 is 101010411.
It can be written as a sum of positive squares in only one way, i.e., 58522500 + 55487601 = 7650^2 + 7449^2 .
It is not a de Polignac number, because 114010101 - 23 = 114010093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12667789 = 114010101 / (1 + 1 + 4 + 0 + 1 + 0 + 1 + 0 + 1).
It is a Duffinian number.
114010101 is a modest number, since divided by 10101 gives 114 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114010121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6333886 + ... + 6333903.
Almost surely, 2114010101 is an apocalyptic number.
It is an amenable number.
114010101 is a deficient number, since it is larger than the sum of its proper divisors (50671169).
114010101 is a wasteful number, since it uses less digits than its factorization.
114010101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12667795 (or 12667792 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 114010101 is about 10677.5512642178. The cubic root of 114010101 is about 484.8950791568.
Adding to 114010101 its reverse (101010411), we get a palindrome (215020512).
The spelling of 114010101 in words is "one hundred fourteen million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •