Base | Representation |
---|---|
bin | 1100001101010110001100… |
… | …0101111100010001110001 |
3 | 1202112021020021201120221111 |
4 | 3003111203011330101301 |
5 | 3224412143414131001 |
6 | 44314350244353321 |
7 | 2553545145314134 |
oct | 303254305742161 |
9 | 52467207646844 |
10 | 13423435302001 |
11 | 430593530937a |
12 | 16096753a5841 |
13 | 764a9460755a |
14 | 3459aa82a21b |
15 | 1842936c8851 |
hex | c356317c471 |
13423435302001 has 4 divisors (see below), whose sum is σ = 13525904273904. Its totient is φ = 13320966330100.
The previous prime is 13423435301959. The next prime is 13423435302019. The reversal of 13423435302001 is 10020353432431.
It is a happy number.
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 13423435302001 - 221 = 13423433204849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13423435302061) 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, 51234485755 + ... + 51234486016.
It is an arithmetic number, because the mean of its divisors is an integer number (3381476068476).
Almost surely, 213423435302001 is an apocalyptic number.
It is an amenable number.
13423435302001 is a deficient number, since it is larger than the sum of its proper divisors (102468971903).
13423435302001 is a wasteful number, since it uses less digits than its factorization.
13423435302001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102468971902.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 13423435302001 its reverse (10020353432431), we get a palindrome (23443788734432).
The spelling of 13423435302001 in words is "thirteen trillion, four hundred twenty-three billion, four hundred thirty-five million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •