Base | Representation |
---|---|
bin | 11001000001100101… |
… | …11111110110101001 |
3 | 1021200022120220110000 |
4 | 30200302333312221 |
5 | 210003344012140 |
6 | 10101053413213 |
7 | 653635550610 |
oct | 144062776651 |
9 | 37608526400 |
10 | 13435141545 |
11 | 5774872771 |
12 | 272b49a209 |
13 | 13615985c7 |
14 | 91647a877 |
15 | 539757a30 |
hex | 320cbfda9 |
13435141545 has 40 divisors (see below), whose sum is σ = 27524274624. Its totient is φ = 6141777696.
The previous prime is 13435141541. The next prime is 13435141609. The reversal of 13435141545 is 54514153431.
13435141545 is a `hidden beast` number, since 134 + 3 + 514 + 1 + 5 + 4 + 5 = 666.
It is not a de Polignac number, because 13435141545 - 22 = 13435141541 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13435141541) 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 39 ways as a sum of consecutive naturals, for example, 2366679 + ... + 2372348.
Almost surely, 213435141545 is an apocalyptic number.
13435141545 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13435141545 is an abundant number, since it is smaller than the sum of its proper divisors (14089133079).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13435141545 is an equidigital number, since it uses as much as digits as its factorization.
13435141545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4739051 (or 4739042 counting only the distinct ones).
The product of its digits is 72000, while the sum is 36.
Adding to 13435141545 its reverse (54514153431), we get a palindrome (67949294976).
The spelling of 13435141545 in words is "thirteen billion, four hundred thirty-five million, one hundred forty-one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •