Base | Representation |
---|---|
bin | 11101011111101000011… |
… | …00000101111110111101 |
3 | 10120212210120110121100001 |
4 | 32233310030011332331 |
5 | 113100433004004001 |
6 | 2053320033434301 |
7 | 133134226636441 |
oct | 16576414057675 |
9 | 3525716417301 |
10 | 1013414125501 |
11 | 360871943a28 |
12 | 1444a640b991 |
13 | 747453b63cb |
14 | 37099bb2821 |
15 | 1b56421c001 |
hex | ebf4305fbd |
1013414125501 has 2 divisors, whose sum is σ = 1013414125502. Its totient is φ = 1013414125500.
The previous prime is 1013414125487. The next prime is 1013414125531. The reversal of 1013414125501 is 1055214143101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 983597815225 + 29816310276 = 991765^2 + 172674^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013414125501 - 235 = 979054387133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1013414125501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013414125531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506707062750 + 506707062751.
It is an arithmetic number, because the mean of its divisors is an integer number (506707062751).
Almost surely, 21013414125501 is an apocalyptic number.
It is an amenable number.
1013414125501 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013414125501 is an equidigital number, since it uses as much as digits as its factorization.
1013414125501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 1013414125501 its reverse (1055214143101), we get a palindrome (2068628268602).
The spelling of 1013414125501 in words is "one trillion, thirteen billion, four hundred fourteen million, one hundred twenty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •