Base | Representation |
---|---|
bin | 11110110100000100110101… |
… | …100001011010000000100101 |
3 | 122202211120210212211020212101 |
4 | 132310010311201122000211 |
5 | 120230324430231243141 |
6 | 1200121010133252101 |
7 | 40354665650322424 |
oct | 3664046541320045 |
9 | 582746725736771 |
10 | 135520001040421 |
11 | 3a1a9789651958 |
12 | 13248826194031 |
13 | 5a8063444757a |
14 | 25672bb2412bb |
15 | 10a02bd7c2531 |
hex | 7b413585a025 |
135520001040421 has 16 divisors (see below), whose sum is σ = 136277623437120. Its totient is φ = 134765136656640.
The previous prime is 135520001040409. The next prime is 135520001040467. The reversal of 135520001040421 is 124040100025531.
It is a cyclic number.
It is not a de Polignac number, because 135520001040421 - 225 = 135519967485989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135520001040421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135520001043421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164109466 + ... + 164933188.
It is an arithmetic number, because the mean of its divisors is an integer number (8517351464820).
Almost surely, 2135520001040421 is an apocalyptic number.
It is an amenable number.
135520001040421 is a deficient number, since it is larger than the sum of its proper divisors (757622396699).
135520001040421 is an equidigital number, since it uses as much as digits as its factorization.
135520001040421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 825396.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 135520001040421 its reverse (124040100025531), we get a palindrome (259560101065952).
The spelling of 135520001040421 in words is "one hundred thirty-five trillion, five hundred twenty billion, one million, forty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •