Base | Representation |
---|---|
bin | 11000001101101110… |
… | …10011001000001101 |
3 | 1020112222220112202112 |
4 | 30012313103020031 |
5 | 203111003431303 |
6 | 5545552233405 |
7 | 640103461541 |
oct | 140667231015 |
9 | 36488815675 |
10 | 13000061453 |
11 | 5571217645 |
12 | 262983b865 |
13 | 12c23c3972 |
14 | 8b4783a21 |
15 | 5114650d8 |
hex | 306dd320d |
13000061453 has 4 divisors (see below), whose sum is σ = 13009476348. Its totient is φ = 12990646560.
The previous prime is 13000061441. The next prime is 13000061509. The reversal of 13000061453 is 35416000031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35416000031 = 557 ⋅63583483.
It can be written as a sum of positive squares in 2 ways, for example, as 9522246724 + 3477814729 = 97582^2 + 58973^2 .
It is a cyclic number.
It is not a de Polignac number, because 13000061453 - 220 = 12999012877 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 (13000061353) 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, 4705376 + ... + 4708137.
It is an arithmetic number, because the mean of its divisors is an integer number (3252369087).
Almost surely, 213000061453 is an apocalyptic number.
It is an amenable number.
13000061453 is a deficient number, since it is larger than the sum of its proper divisors (9414895).
13000061453 is an equidigital number, since it uses as much as digits as its factorization.
13000061453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9414894.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 13000061453 its reverse (35416000031), we get a palindrome (48416061484).
The spelling of 13000061453 in words is "thirteen billion, sixty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •