Base | Representation |
---|---|
bin | 11101011111000100100… |
… | …11101000110100010101 |
3 | 10120212000122221101222002 |
4 | 32233202103220310111 |
5 | 113044324203111201 |
6 | 2053230155245045 |
7 | 133123624606343 |
oct | 16574223506425 |
9 | 3525018841862 |
10 | 1013114113301 |
11 | 360728561364 |
12 | 144421a49785 |
13 | 746c81b2bb4 |
14 | 3706bdd8993 |
15 | 1b547c0976b |
hex | ebe24e8d15 |
1013114113301 has 2 divisors, whose sum is σ = 1013114113302. Its totient is φ = 1013114113300.
The previous prime is 1013114113289. The next prime is 1013114113309. The reversal of 1013114113301 is 1033114113101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 839184244900 + 173929868401 = 916070^2 + 417049^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013114113301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013114113309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506557056650 + 506557056651.
It is an arithmetic number, because the mean of its divisors is an integer number (506557056651).
Almost surely, 21013114113301 is an apocalyptic number.
It is an amenable number.
1013114113301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013114113301 is an equidigital number, since it uses as much as digits as its factorization.
1013114113301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1013114113301 its reverse (1033114113101), we get a palindrome (2046228226402).
The spelling of 1013114113301 in words is "one trillion, thirteen billion, one hundred fourteen million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •