Base | Representation |
---|---|
bin | 11001000001010010… |
… | …11110011110101001 |
3 | 1021200010220002120120 |
4 | 30200221132132221 |
5 | 210002224124140 |
6 | 10100524113453 |
7 | 653605413624 |
oct | 144051363651 |
9 | 37603802516 |
10 | 13432645545 |
11 | 5773418460 |
12 | 272a695889 |
13 | 1360c03497 |
14 | 915dcadbb |
15 | 5394131d0 |
hex | 320a5e7a9 |
13432645545 has 16 divisors (see below), whose sum is σ = 23446072512. Its totient is φ = 6512797760.
The previous prime is 13432645507. The next prime is 13432645547. The reversal of 13432645545 is 54554623431.
13432645545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13432645545 - 29 = 13432645033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13432645497 and 13432645506.
It is not an unprimeable number, because it can be changed into a prime (13432645547) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 40704822 + ... + 40705151.
It is an arithmetic number, because the mean of its divisors is an integer number (1465379532).
Almost surely, 213432645545 is an apocalyptic number.
13432645545 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13432645545 is a deficient number, since it is larger than the sum of its proper divisors (10013426967).
13432645545 is a wasteful number, since it uses less digits than its factorization.
13432645545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81409992.
The product of its digits is 864000, while the sum is 42.
The spelling of 13432645545 in words is "thirteen billion, four hundred thirty-two million, six hundred forty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •