Base | Representation |
---|---|
bin | 10010111011110000011… |
… | …000010010101010001001 |
3 | 11121101101210200212220102 |
4 | 102323300120102222021 |
5 | 132304134413214423 |
6 | 2433420103335145 |
7 | 163000536134621 |
oct | 22736030225211 |
9 | 4541353625812 |
10 | 1301113023113 |
11 | 461887421a02 |
12 | 1901b81514b5 |
13 | 959048879b7 |
14 | 46d8d317881 |
15 | 23ca19cec28 |
hex | 12ef0612a89 |
1301113023113 has 4 divisors (see below), whose sum is σ = 1304117903508. Its totient is φ = 1298108142720.
The previous prime is 1301113023109. The next prime is 1301113023167. The reversal of 1301113023113 is 3113203111031.
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 232552524169 + 1068560498944 = 482237^2 + 1033712^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301113023113 - 22 = 1301113023109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1301113023173) 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, 1502439548 + ... + 1502440413.
It is an arithmetic number, because the mean of its divisors is an integer number (326029475877).
Almost surely, 21301113023113 is an apocalyptic number.
It is an amenable number.
1301113023113 is a deficient number, since it is larger than the sum of its proper divisors (3004880395).
1301113023113 is an equidigital number, since it uses as much as digits as its factorization.
1301113023113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3004880394.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1301113023113 its reverse (3113203111031), we get a palindrome (4414316134144).
The spelling of 1301113023113 in words is "one trillion, three hundred one billion, one hundred thirteen million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •