Base | Representation |
---|---|
bin | 1100001101011101010101… |
… | …1110011000011011101101 |
3 | 1202112110012000200100221212 |
4 | 3003113111132120123231 |
5 | 3224430111200431110 |
6 | 44315304515404205 |
7 | 2553643536525551 |
oct | 303272536303355 |
9 | 52473160610855 |
10 | 13425354311405 |
11 | 430672a568563 |
12 | 1609b0bbb3665 |
13 | 76500c06568a |
14 | 345b0d641861 |
15 | 184356ddde05 |
hex | c35d57986ed |
13425354311405 has 8 divisors (see below), whose sum is σ = 16130048108184. Its totient is φ = 10727201492800.
The previous prime is 13425354311359. The next prime is 13425354311419. The reversal of 13425354311405 is 50411345352431.
It can be written as a sum of positive squares in 4 ways, for example, as 24036781444 + 13401317529961 = 155038^2 + 3660781^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13425354311405 - 216 = 13425354245869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1635240026 + ... + 1635248235.
It is an arithmetic number, because the mean of its divisors is an integer number (2016256013523).
Almost surely, 213425354311405 is an apocalyptic number.
It is an amenable number.
13425354311405 is a deficient number, since it is larger than the sum of its proper divisors (2704693796779).
13425354311405 is an equidigital number, since it uses as much as digits as its factorization.
13425354311405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3270489087.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 13425354311405 its reverse (50411345352431), we get a palindrome (63836699663836).
The spelling of 13425354311405 in words is "thirteen trillion, four hundred twenty-five billion, three hundred fifty-four million, three hundred eleven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •