Base | Representation |
---|---|
bin | 11110110010101000001011… |
… | …101100110110111000111101 |
3 | 122202111002000112120110022211 |
4 | 132302220023230312320331 |
5 | 120222212203334321141 |
6 | 1200003154213340421 |
7 | 40344544415242003 |
oct | 3662501354667075 |
9 | 582432015513284 |
10 | 135420515151421 |
11 | 3a170577440a85 |
12 | 132314a0637711 |
13 | 5a7413b2c0a26 |
14 | 25625605aaa73 |
15 | 109c8e978bd81 |
hex | 7b2a0bb36e3d |
135420515151421 has 4 divisors (see below), whose sum is σ = 138569829457312. Its totient is φ = 132271200845532.
The previous prime is 135420515151413. The next prime is 135420515151463. The reversal of 135420515151421 is 124151515024531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 135420515151421 - 23 = 135420515151413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135420515251421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1574657152881 + ... + 1574657152966.
It is an arithmetic number, because the mean of its divisors is an integer number (34642457364328).
Almost surely, 2135420515151421 is an apocalyptic number.
It is an amenable number.
135420515151421 is a deficient number, since it is larger than the sum of its proper divisors (3149314305891).
135420515151421 is an equidigital number, since it uses as much as digits as its factorization.
135420515151421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3149314305890.
The product of its (nonzero) digits is 120000, while the sum is 40.
The spelling of 135420515151421 in words is "one hundred thirty-five trillion, four hundred twenty billion, five hundred fifteen million, one hundred fifty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •