Base | Representation |
---|---|
bin | 11000011011001111… |
… | …01111011001011101 |
3 | 1020211220012221012010 |
4 | 30031213233121131 |
5 | 203324014022303 |
6 | 10005122101433 |
7 | 642651155154 |
oct | 141547573135 |
9 | 36756187163 |
10 | 13113423453 |
11 | 561a205149 |
12 | 265b7aa879 |
13 | 130ca35380 |
14 | 8c585259b |
15 | 51b3a8c03 |
hex | 30d9ef65d |
13113423453 has 8 divisors (see below), whose sum is σ = 18829531168. Its totient is φ = 8069799024.
The previous prime is 13113423443. The next prime is 13113423461. The reversal of 13113423453 is 35432431131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13113423453 - 24 = 13113423437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13113423453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13113423443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168120775 + ... + 168120852.
It is an arithmetic number, because the mean of its divisors is an integer number (2353691396).
Almost surely, 213113423453 is an apocalyptic number.
13113423453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13113423453 is a deficient number, since it is larger than the sum of its proper divisors (5716107715).
13113423453 is a wasteful number, since it uses less digits than its factorization.
13113423453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336241643.
The product of its digits is 12960, while the sum is 30.
Adding to 13113423453 its reverse (35432431131), we get a palindrome (48545854584).
The spelling of 13113423453 in words is "thirteen billion, one hundred thirteen million, four hundred twenty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •