Base | Representation |
---|---|
bin | 11110110011001000010101… |
… | …101100011100001001100101 |
3 | 122202121101010210222011022110 |
4 | 132303020111230130021211 |
5 | 120223243411343134141 |
6 | 1200031104255351233 |
7 | 40350206141303454 |
oct | 3663102554341145 |
9 | 582541123864273 |
10 | 135455042552421 |
11 | 3a184185240429 |
12 | 13238117822519 |
13 | 5a77481634617 |
14 | 25640b8014b9b |
15 | 109d76aab7e16 |
hex | 7b3215b1c265 |
135455042552421 has 32 divisors (see below), whose sum is σ = 192238904696832. Its totient is φ = 84708445423680.
The previous prime is 135455042552321. The next prime is 135455042552491. The reversal of 135455042552421 is 124255240554531.
It is not a de Polignac number, because 135455042552421 - 215 = 135455042519653 is a prime.
It is a super-2 number, since 2×1354550425524212 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135455042552491) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 165140545 + ... + 165958758.
It is an arithmetic number, because the mean of its divisors is an integer number (6007465771776).
Almost surely, 2135455042552421 is an apocalyptic number.
It is an amenable number.
135455042552421 is a deficient number, since it is larger than the sum of its proper divisors (56783862144411).
135455042552421 is a wasteful number, since it uses less digits than its factorization.
135455042552421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331099473.
The product of its (nonzero) digits is 4800000, while the sum is 48.
The spelling of 135455042552421 in words is "one hundred thirty-five trillion, four hundred fifty-five billion, forty-two million, five hundred fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •