Base | Representation |
---|---|
bin | 1100000001010001100010… |
… | …0100001010110100000011 |
3 | 1201210102212121110222211211 |
4 | 3000110120210022310003 |
5 | 3213012410241120301 |
6 | 44035205254150551 |
7 | 2532553312525231 |
oct | 300243044126403 |
9 | 51712777428754 |
10 | 13216026504451 |
11 | 42359814699a1 |
12 | 1595430652457 |
13 | 74b35c3b0704 |
14 | 3399327b7951 |
15 | 17dba4ada051 |
hex | c051890ad03 |
13216026504451 has 4 divisors (see below), whose sum is σ = 13255954077304. Its totient is φ = 13176098931600.
The previous prime is 13216026504409. The next prime is 13216026504509. The reversal of 13216026504451 is 15440562061231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13216026504451 - 219 = 13216025980163 is a prime.
It is a super-2 number, since 2×132160265044512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13216026514451) 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, 19963785930 + ... + 19963786591.
It is an arithmetic number, because the mean of its divisors is an integer number (3313988519326).
Almost surely, 213216026504451 is an apocalyptic number.
13216026504451 is a deficient number, since it is larger than the sum of its proper divisors (39927572853).
13216026504451 is an equidigital number, since it uses as much as digits as its factorization.
13216026504451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39927572852.
The product of its (nonzero) digits is 172800, while the sum is 40.
Adding to 13216026504451 its reverse (15440562061231), we get a palindrome (28656588565682).
The spelling of 13216026504451 in words is "thirteen trillion, two hundred sixteen billion, twenty-six million, five hundred four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •