Base | Representation |
---|---|
bin | 11110110100100001001001… |
… | …100000001100111010110100 |
3 | 122202221111021111210020120122 |
4 | 132310201021200030322310 |
5 | 120231324210131240202 |
6 | 1200142554454551112 |
7 | 40360123205132105 |
oct | 3664411140147264 |
9 | 582844244706518 |
10 | 135550401040052 |
11 | 3a210669660599 |
12 | 132526ab068498 |
13 | 5a8346a650a2b |
14 | 25689628503ac |
15 | 10a0e9c5ae9a2 |
hex | 7b484980ceb4 |
135550401040052 has 24 divisors (see below), whose sum is σ = 251169407326656. Its totient is φ = 63787792208768.
The previous prime is 135550401040049. The next prime is 135550401040097. The reversal of 135550401040052 is 250040104055531.
It is a super-2 number, since 2×1355504010400522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 135550401039994 and 135550401040021.
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, 2920448 + ... + 16722135.
It is an arithmetic number, because the mean of its divisors is an integer number (10465391971944).
Almost surely, 2135550401040052 is an apocalyptic number.
It is an amenable number.
135550401040052 is a deficient number, since it is larger than the sum of its proper divisors (115619006286604).
135550401040052 is a wasteful number, since it uses less digits than its factorization.
135550401040052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19744087 (or 19744085 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
Adding to 135550401040052 its reverse (250040104055531), we get a palindrome (385590505095583).
The spelling of 135550401040052 in words is "one hundred thirty-five trillion, five hundred fifty billion, four hundred one million, forty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •