Base | Representation |
---|---|
bin | 11101011111101011101… |
… | …00001011010101100001 |
3 | 10120212212110210211011220 |
4 | 32233311310023111201 |
5 | 113101012000113101 |
6 | 2053322450325253 |
7 | 133135010566320 |
oct | 16576564132541 |
9 | 3525773724156 |
10 | 1013441410401 |
11 | 36088628a532 |
12 | 1444b3589829 |
13 | 7474ac4a614 |
14 | 3709d6760b7 |
15 | 1b56680b636 |
hex | ebf5d0b561 |
1013441410401 has 8 divisors (see below), whose sum is σ = 1544291673024. Its totient is φ = 579109377360.
The previous prime is 1013441410361. The next prime is 1013441410409. The reversal of 1013441410401 is 1040141443101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1013441410401 - 29 = 1013441409889 is a prime.
It is a super-2 number, since 2×10134414104012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1013441410409) 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, 24129557370 + ... + 24129557411.
It is an arithmetic number, because the mean of its divisors is an integer number (193036459128).
Almost surely, 21013441410401 is an apocalyptic number.
It is an amenable number.
1013441410401 is a deficient number, since it is larger than the sum of its proper divisors (530850262623).
1013441410401 is an equidigital number, since it uses as much as digits as its factorization.
1013441410401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48259114791.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1013441410401 its reverse (1040141443101), we get a palindrome (2053582853502).
The spelling of 1013441410401 in words is "one trillion, thirteen billion, four hundred forty-one million, four hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •