Base | Representation |
---|---|
bin | 1100001100000011011011… |
… | …1110110111001100101001 |
3 | 1202110010220002111021002012 |
4 | 3003000312332313030221 |
5 | 3224031144411142301 |
6 | 44300234034245305 |
7 | 2552130510004436 |
oct | 303006676671451 |
9 | 52403802437065 |
10 | 13401220412201 |
11 | 42a747560a916 |
12 | 16052b5726835 |
13 | 7629640b6b4b |
14 | 3448a030cb8d |
15 | 1838e329debb |
hex | c3036fb7329 |
13401220412201 has 8 divisors (see below), whose sum is σ = 13467762693504. Its totient is φ = 13334803802640.
The previous prime is 13401220412189. The next prime is 13401220412221. The reversal of 13401220412201 is 10221402210431.
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 13401220412201 - 26 = 13401220412137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13401220412221) 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, 31204130 + ... + 31630683.
It is an arithmetic number, because the mean of its divisors is an integer number (1683470336688).
Almost surely, 213401220412201 is an apocalyptic number.
It is an amenable number.
13401220412201 is a deficient number, since it is larger than the sum of its proper divisors (66542281303).
13401220412201 is an equidigital number, since it uses as much as digits as its factorization.
13401220412201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62835871.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 13401220412201 its reverse (10221402210431), we get a palindrome (23622622622632).
The spelling of 13401220412201 in words is "thirteen trillion, four hundred one billion, two hundred twenty million, four hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •