Base | Representation |
---|---|
bin | 11000001101110001… |
… | …11001111010010101 |
3 | 1020120000200221021010 |
4 | 30012320321322111 |
5 | 203111110414303 |
6 | 5550005242433 |
7 | 640110164130 |
oct | 140670717225 |
9 | 36500627233 |
10 | 13000482453 |
11 | 5571484982 |
12 | 2629a03419 |
13 | 12c251048a |
14 | 8b4853217 |
15 | 5114e9c03 |
hex | 306e39e95 |
13000482453 has 8 divisors (see below), whose sum is σ = 19810259008. Its totient is φ = 7428847104.
The previous prime is 13000482449. The next prime is 13000482457. The reversal of 13000482453 is 35428400031.
It is an interprime number because it is at equal distance from previous prime (13000482449) and next prime (13000482457).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13000482453 - 22 = 13000482449 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 13000482453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000482457) 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, 309535276 + ... + 309535317.
It is an arithmetic number, because the mean of its divisors is an integer number (2476282376).
Almost surely, 213000482453 is an apocalyptic number.
It is an amenable number.
13000482453 is a deficient number, since it is larger than the sum of its proper divisors (6809776555).
13000482453 is an equidigital number, since it uses as much as digits as its factorization.
13000482453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619070603.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 13000482453 its reverse (35428400031), we get a palindrome (48428882484).
The spelling of 13000482453 in words is "thirteen billion, four hundred eighty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •