Base | Representation |
---|---|
bin | 11101100000111011011… |
… | …11001110111100011101 |
3 | 10120221121011010211000221 |
4 | 32300131233032330131 |
5 | 113103344431444401 |
6 | 2053513134321341 |
7 | 133160422666603 |
oct | 16603557167435 |
9 | 3527534124027 |
10 | 1014111203101 |
11 | 36109a377717 |
12 | 14465b959251 |
13 | 74826941569 |
14 | 371245c9873 |
15 | 1b5a55137a1 |
hex | ec1dbcef1d |
1014111203101 has 4 divisors (see below), whose sum is σ = 1018463611932. Its totient is φ = 1009758794272.
The previous prime is 1014111203059. The next prime is 1014111203113. The reversal of 1014111203101 is 1013021114101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 363007455001 + 651103748100 = 602501^2 + 806910^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014111203101 - 219 = 1014110678813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014111203201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2176204066 + ... + 2176204531.
It is an arithmetic number, because the mean of its divisors is an integer number (254615902983).
Almost surely, 21014111203101 is an apocalyptic number.
It is an amenable number.
1014111203101 is a deficient number, since it is larger than the sum of its proper divisors (4352408831).
1014111203101 is an equidigital number, since it uses as much as digits as its factorization.
1014111203101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4352408830.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1014111203101 its reverse (1013021114101), we get a palindrome (2027132317202).
The spelling of 1014111203101 in words is "one trillion, fourteen billion, one hundred eleven million, two hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •