Base | Representation |
---|---|
bin | 11101011111011111100… |
… | …01011001110111101001 |
3 | 10120212121102000122222022 |
4 | 32233233301121313221 |
5 | 113100310021121301 |
6 | 2053304425234225 |
7 | 133132340024135 |
oct | 16575761316751 |
9 | 3525542018868 |
10 | 1013340020201 |
11 | 360834029583 |
12 | 144485632975 |
13 | 74732c3b112 |
14 | 370900023c5 |
15 | 1b55c97ed1b |
hex | ebefc59de9 |
1013340020201 has 4 divisors (see below), whose sum is σ = 1013882785872. Its totient is φ = 1012797254532.
The previous prime is 1013340020153. The next prime is 1013340020267. The reversal of 1013340020201 is 1020200433101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1013340020201 - 26 = 1013340020137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1013340020201.
It is not an unprimeable number, because it can be changed into a prime (1013340020101) 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, 271380035 + ... + 271383768.
It is an arithmetic number, because the mean of its divisors is an integer number (253470696468).
Almost surely, 21013340020201 is an apocalyptic number.
It is an amenable number.
1013340020201 is a deficient number, since it is larger than the sum of its proper divisors (542765671).
1013340020201 is an equidigital number, since it uses as much as digits as its factorization.
1013340020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542765670.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1013340020201 its reverse (1020200433101), we get a palindrome (2033540453302).
The spelling of 1013340020201 in words is "one trillion, thirteen billion, three hundred forty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •