Base | Representation |
---|---|
bin | 110110001101… |
… | …010000110101 |
3 | 222201221121001 |
4 | 312031100311 |
5 | 12114210401 |
6 | 1224323301 |
7 | 231532603 |
oct | 66152065 |
9 | 28657531 |
10 | 14210101 |
11 | 8026294 |
12 | 4913531 |
13 | 2c36c59 |
14 | 1c5c873 |
15 | 13aa601 |
hex | d8d435 |
14210101 has 2 divisors, whose sum is σ = 14210102. Its totient is φ = 14210100.
The previous prime is 14210099. The next prime is 14210117. The reversal of 14210101 is 10101241.
14210101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11553201 + 2656900 = 3399^2 + 1630^2 .
It is a cyclic number.
It is not a de Polignac number, because 14210101 - 21 = 14210099 is a prime.
It is a super-3 number, since 3×142101013 (a number of 22 digits) contains 333 as substring.
Together with 14210099, 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 (14210171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7105050 + 7105051.
It is an arithmetic number, because the mean of its divisors is an integer number (7105051).
Almost surely, 214210101 is an apocalyptic number.
It is an amenable number.
14210101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14210101 is an equidigital number, since it uses as much as digits as its factorization.
14210101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 14210101 is about 3769.6287615626. The cubic root of 14210101 is about 242.2138957647.
Adding to 14210101 its reverse (10101241), we get a palindrome (24311342).
The spelling of 14210101 in words is "fourteen million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •