Base | Representation |
---|---|
bin | 11101011111001000001… |
… | …11001011110101100101 |
3 | 10120212002202221022000221 |
4 | 32233210013023311211 |
5 | 113044404431401201 |
6 | 2053233200404341 |
7 | 133124443223362 |
oct | 16574407136545 |
9 | 3525082838027 |
10 | 1013144403301 |
11 | 36074366a718 |
12 | 1444300166b1 |
13 | 74701559b84 |
14 | 37072041469 |
15 | 1b54a6de4a1 |
hex | ebe41cbd65 |
1013144403301 has 8 divisors (see below), whose sum is σ = 1030453099200. Its totient is φ = 995840266080.
The previous prime is 1013144403289. The next prime is 1013144403443. The reversal of 1013144403301 is 1033044413101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1013144403301 - 25 = 1013144403269 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 (1013144403001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 689880 + ... + 1581841.
It is an arithmetic number, because the mean of its divisors is an integer number (128806637400).
Almost surely, 21013144403301 is an apocalyptic number.
It is an amenable number.
1013144403301 is a deficient number, since it is larger than the sum of its proper divisors (17308695899).
1013144403301 is an equidigital number, since it uses as much as digits as its factorization.
1013144403301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2279339.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1013144403301 its reverse (1033044413101), we get a palindrome (2046188816402).
The spelling of 1013144403301 in words is "one trillion, thirteen billion, one hundred forty-four million, four hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •