Base | Representation |
---|---|
bin | 11000010001110010… |
… | …01100110111110001 |
3 | 1020122100222121211011 |
4 | 30020321030313301 |
5 | 203143213131140 |
6 | 5553210150521 |
7 | 640666100644 |
oct | 141071146761 |
9 | 36570877734 |
10 | 13034114545 |
11 | 55894661a1 |
12 | 2639122441 |
13 | 12c948771a |
14 | 8b90c9a5b |
15 | 51443ecea |
hex | 308e4cdf1 |
13034114545 has 4 divisors (see below), whose sum is σ = 15640937460. Its totient is φ = 10427291632.
The previous prime is 13034114531. The next prime is 13034114567. The reversal of 13034114545 is 54541143031.
13034114545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3880791616 + 9153322929 = 62296^2 + 95673^2 .
It is a cyclic number.
It is not a de Polignac number, because 13034114545 - 27 = 13034114417 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1303411450 + ... + 1303411459.
It is an arithmetic number, because the mean of its divisors is an integer number (3910234365).
Almost surely, 213034114545 is an apocalyptic number.
It is an amenable number.
13034114545 is a deficient number, since it is larger than the sum of its proper divisors (2606822915).
13034114545 is an equidigital number, since it uses as much as digits as its factorization.
13034114545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2606822914.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 13034114545 its reverse (54541143031), we get a palindrome (67575257576).
The spelling of 13034114545 in words is "thirteen billion, thirty-four million, one hundred fourteen thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •