Base | Representation |
---|---|
bin | 1100010010101101010100… |
… | …0110000000001110100101 |
3 | 1202212001222101011112110002 |
4 | 3010223111012000032211 |
5 | 3232414312302442041 |
6 | 44424542051511045 |
7 | 2563315510315502 |
oct | 304532506001645 |
9 | 52761871145402 |
10 | 13515542234021 |
11 | 4340a002726a3 |
12 | 162349b8b8485 |
13 | 770682aa3969 |
14 | 34a22749a4a9 |
15 | 1868849db59b |
hex | c4ad51803a5 |
13515542234021 has 4 divisors (see below), whose sum is σ = 13515755050272. Its totient is φ = 13515329417772.
The previous prime is 13515542233997. The next prime is 13515542234039. The reversal of 13515542234021 is 12043224551531.
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 a de Polignac number, because none of the positive numbers 2k-13515542234021 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 (13515542234221) 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, 106312835 + ... + 106439888.
It is an arithmetic number, because the mean of its divisors is an integer number (3378938762568).
Almost surely, 213515542234021 is an apocalyptic number.
It is an amenable number.
13515542234021 is a deficient number, since it is larger than the sum of its proper divisors (212816251).
13515542234021 is an equidigital number, since it uses as much as digits as its factorization.
13515542234021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212816250.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 13515542234021 its reverse (12043224551531), we get a palindrome (25558766785552).
The spelling of 13515542234021 in words is "thirteen trillion, five hundred fifteen billion, five hundred forty-two million, two hundred thirty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •