Base | Representation |
---|---|
bin | 11101011111001000000… |
… | …11011001011011101101 |
3 | 10120212002201001212001022 |
4 | 32233210003121123231 |
5 | 113044404203113123 |
6 | 2053233123223525 |
7 | 133124431616561 |
oct | 16574403313355 |
9 | 3525081055038 |
10 | 1013143410413 |
11 | 360743051752 |
12 | 14442b817ba5 |
13 | 7470129cc74 |
14 | 37071c636a1 |
15 | 1b54a5951c8 |
hex | ebe40d96ed |
1013143410413 has 8 divisors (see below), whose sum is σ = 1028870287200. Its totient is φ = 997434337680.
The previous prime is 1013143410371. The next prime is 1013143410421. The reversal of 1013143410413 is 3140143413101.
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 1013143410413 - 210 = 1013143409389 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 (1013143410443) 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, 4336298 + ... + 4563963.
It is an arithmetic number, because the mean of its divisors is an integer number (128608785900).
Almost surely, 21013143410413 is an apocalyptic number.
It is an amenable number.
1013143410413 is a deficient number, since it is larger than the sum of its proper divisors (15726876787).
1013143410413 is an equidigital number, since it uses as much as digits as its factorization.
1013143410413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8902027.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1013143410413 its reverse (3140143413101), we get a palindrome (4153286823514).
The spelling of 1013143410413 in words is "one trillion, thirteen billion, one hundred forty-three million, four hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •