Base | Representation |
---|---|
bin | 1100010100011011100011… |
… | …1011111101111000100000 |
3 | 1202221220100201110002112022 |
4 | 3011012320323331320200 |
5 | 3233410413430041000 |
6 | 44450314323121012 |
7 | 2565414030346115 |
oct | 305067073757040 |
9 | 52856321402468 |
10 | 13545134612000 |
11 | 4352506405222 |
12 | 162917a213168 |
13 | 7733ba8890a4 |
14 | 34b83371890c |
15 | 187517948585 |
hex | c51b8efde20 |
13545134612000 has 48 divisors (see below), whose sum is σ = 33280395751512. Its totient is φ = 5418053843200.
The previous prime is 13545134611949. The next prime is 13545134612017. The reversal of 13545134612000 is 21643154531.
It can be written as a sum of positive squares in 4 ways, for example, as 7077451481104 + 6467683130896 = 2660348^2 + 2543164^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1693137827 + ... + 1693145826.
Almost surely, 213545134612000 is an apocalyptic number.
13545134612000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13545134612000 is an abundant number, since it is smaller than the sum of its proper divisors (19735261139512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13545134612000 is an equidigital number, since it uses as much as digits as its factorization.
13545134612000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3386283678 (or 3386283660 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 13545134612000 its reverse (21643154531), we get a palindrome (13566777766531).
The spelling of 13545134612000 in words is "thirteen trillion, five hundred forty-five billion, one hundred thirty-four million, six hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •