Base | Representation |
---|---|
bin | 11000101101010000… |
… | …01110101011101111 |
3 | 1021020102120210002121 |
4 | 30112220032223233 |
5 | 204131210442133 |
6 | 10032121133411 |
7 | 646464533233 |
oct | 142650165357 |
9 | 37212523077 |
10 | 13264546543 |
11 | 5697544166 |
12 | 26a232a267 |
13 | 1335138511 |
14 | 8db9505c3 |
15 | 5297ab02d |
hex | 316a0eaef |
13264546543 has 4 divisors (see below), whose sum is σ = 13264965088. Its totient is φ = 13264128000.
The previous prime is 13264546523. The next prime is 13264546567. The reversal of 13264546543 is 34564546231.
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: 34564546231 = 383 ⋅90246857.
It is a cyclic number.
It is not a de Polignac number, because 13264546543 - 25 = 13264546511 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13264546543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13264546523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 157458 + ... + 226543.
It is an arithmetic number, because the mean of its divisors is an integer number (3316241272).
Almost surely, 213264546543 is an apocalyptic number.
13264546543 is a deficient number, since it is larger than the sum of its proper divisors (418545).
13264546543 is an equidigital number, since it uses as much as digits as its factorization.
13264546543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418544.
The product of its digits is 1036800, while the sum is 43.
The spelling of 13264546543 in words is "thirteen billion, two hundred sixty-four million, five hundred forty-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •