Base | Representation |
---|---|
bin | 110101100001… |
… | …010100010101 |
3 | 222101210200101 |
4 | 311201110111 |
5 | 12042430401 |
6 | 1220414101 |
7 | 230153041 |
oct | 65412425 |
9 | 28353611 |
10 | 14030101 |
11 | 7a13028 |
12 | 4847331 |
13 | 2ba3047 |
14 | 1c13021 |
15 | 1372101 |
hex | d61515 |
14030101 has 2 divisors, whose sum is σ = 14030102. Its totient is φ = 14030100.
The previous prime is 14030099. The next prime is 14030119. The reversal of 14030101 is 10103041.
It is a happy number.
14030101 is digitally balanced in base 3, 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., 13032100 + 998001 = 3610^2 + 999^2 .
It is a cyclic number.
It is not a de Polignac number, because 14030101 - 21 = 14030099 is a prime.
Together with 14030099, 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 (14030131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7015050 + 7015051.
It is an arithmetic number, because the mean of its divisors is an integer number (7015051).
Almost surely, 214030101 is an apocalyptic number.
It is an amenable number.
14030101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14030101 is an equidigital number, since it uses as much as digits as its factorization.
14030101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 14030101 is about 3745.6776422965. The cubic root of 14030101 is about 241.1868353701.
Adding to 14030101 its reverse (10103041), we get a palindrome (24133142).
The spelling of 14030101 in words is "fourteen million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •