Base | Representation |
---|---|
bin | 1100010100001110100011… |
… | …1100100101010000100011 |
3 | 1202221120100112100010220201 |
4 | 3011003220330211100203 |
5 | 3233331242122043410 |
6 | 44444540151050031 |
7 | 2565231406161553 |
oct | 305035074452043 |
9 | 52846315303821 |
10 | 13541645112355 |
11 | 4350a856aa518 |
12 | 1628565670917 |
13 | 772c82957cb9 |
14 | 34b5c20d1163 |
15 | 1873b141283a |
hex | c50e8f25423 |
13541645112355 has 8 divisors (see below), whose sum is σ = 16294251995712. Its totient is φ = 10803797515968.
The previous prime is 13541645112353. The next prime is 13541645112389. The reversal of 13541645112355 is 55321154614531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13541645112355 - 21 = 13541645112353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13541645112353) 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 7 ways as a sum of consecutive naturals, for example, 3689819722 + ... + 3689823391.
It is an arithmetic number, because the mean of its divisors is an integer number (2036781499464).
Almost surely, 213541645112355 is an apocalyptic number.
13541645112355 is a deficient number, since it is larger than the sum of its proper divisors (2752606883357).
13541645112355 is an equidigital number, since it uses as much as digits as its factorization.
13541645112355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7379643485.
The product of its digits is 1080000, while the sum is 46.
Adding to 13541645112355 its reverse (55321154614531), we get a palindrome (68862799726886).
The spelling of 13541645112355 in words is "thirteen trillion, five hundred forty-one billion, six hundred forty-five million, one hundred twelve thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •