Base | Representation |
---|---|
bin | 11110110110000011000011… |
… | …001010100110011111001000 |
3 | 122210022112121112022111010020 |
4 | 132312003003022212133020 |
5 | 120240040001440204224 |
6 | 1200303141453220440 |
7 | 40400534165431602 |
oct | 3666030312463710 |
9 | 583275545274106 |
10 | 135655521413064 |
11 | 3a25120233a724 |
12 | 1326ab47791720 |
13 | 5a90350c16993 |
14 | 256da95948172 |
15 | 10a3aa10cbc79 |
hex | 7b60c32a67c8 |
135655521413064 has 64 divisors (see below), whose sum is σ = 340282087147200. Its totient is φ = 45066236219136.
The previous prime is 135655521413051. The next prime is 135655521413129. The reversal of 135655521413064 is 460314125556531.
It is a junction number, because it is equal to n+sod(n) for n = 135655521412998 and 135655521413016.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7792647 + ... + 18221865.
It is an arithmetic number, because the mean of its divisors is an integer number (5316907611675).
Almost surely, 2135655521413064 is an apocalyptic number.
It is an amenable number.
135655521413064 is an abundant number, since it is smaller than the sum of its proper divisors (204626565734136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135655521413064 is a wasteful number, since it uses less digits than its factorization.
135655521413064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10431054 (or 10431050 counting only the distinct ones).
The product of its (nonzero) digits is 6480000, while the sum is 51.
Adding to 135655521413064 its reverse (460314125556531), we get a palindrome (595969646969595).
The spelling of 135655521413064 in words is "one hundred thirty-five trillion, six hundred fifty-five billion, five hundred twenty-one million, four hundred thirteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •