Base | Representation |
---|---|
bin | 1100000001000111000011… |
… | …1111101110000100010101 |
3 | 1201210011121200102121122211 |
4 | 3000101300333232010111 |
5 | 3212441131034420303 |
6 | 44034022305153421 |
7 | 2532423534455446 |
oct | 300216077560425 |
9 | 51704550377584 |
10 | 13213215154453 |
11 | 423476953a046 |
12 | 159498702b871 |
13 | 74b001b0b2c2 |
14 | 33974727b2cd |
15 | 17da8cdac66d |
hex | c0470fee115 |
13213215154453 has 4 divisors (see below), whose sum is σ = 13787702769888. Its totient is φ = 12638727539020.
The previous prime is 13213215154421. The next prime is 13213215154459. The reversal of 13213215154453 is 35445151231231.
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 13213215154453 - 25 = 13213215154421 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 (13213215154459) 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, 287243807683 + ... + 287243807728.
It is an arithmetic number, because the mean of its divisors is an integer number (3446925692472).
Almost surely, 213213215154453 is an apocalyptic number.
It is an amenable number.
13213215154453 is a deficient number, since it is larger than the sum of its proper divisors (574487615435).
13213215154453 is an equidigital number, since it uses as much as digits as its factorization.
13213215154453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 574487615434.
The product of its digits is 216000, while the sum is 40.
Adding to 13213215154453 its reverse (35445151231231), we get a palindrome (48658366385684).
The spelling of 13213215154453 in words is "thirteen trillion, two hundred thirteen billion, two hundred fifteen million, one hundred fifty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •