Base | Representation |
---|---|
bin | 111100011100100… |
… | …010001101001101 |
3 | 2121200020021122111 |
4 | 330130202031031 |
5 | 4034103104401 |
6 | 244343544021 |
7 | 34062550651 |
oct | 7434421515 |
9 | 2550207574 |
10 | 1014113101 |
11 | 480493201 |
12 | 24375b011 |
13 | 13213bc31 |
14 | 98982a61 |
15 | 5e06ce51 |
hex | 3c72234d |
1014113101 has 2 divisors, whose sum is σ = 1014113102. Its totient is φ = 1014113100.
The previous prime is 1014113099. The next prime is 1014113129. The reversal of 1014113101 is 1013114101.
It is a happy number.
1014113101 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., 931775625 + 82337476 = 30525^2 + 9074^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014113101 - 21 = 1014113099 is a prime.
Together with 1014113099, 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 (1014119101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507056550 + 507056551.
It is an arithmetic number, because the mean of its divisors is an integer number (507056551).
Almost surely, 21014113101 is an apocalyptic number.
It is an amenable number.
1014113101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014113101 is an equidigital number, since it uses as much as digits as its factorization.
1014113101 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 13.
The square root of 1014113101 is about 31845.1425024288. The cubic root of 1014113101 is about 1004.6824078363.
Adding to 1014113101 its reverse (1013114101), we get a palindrome (2027227202).
The spelling of 1014113101 in words is "one billion, fourteen million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •