Base | Representation |
---|---|
bin | 11110110011011110110110… |
… | …101100100001000001010001 |
3 | 122202200200112200100121102222 |
4 | 132303132312230201001101 |
5 | 120224142414421300000 |
6 | 1200050143242550425 |
7 | 40352023221643211 |
oct | 3663366654410121 |
9 | 582620480317388 |
10 | 135479218540625 |
11 | 3a193460a26173 |
12 | 13240944208415 |
13 | 5a7983522b79b |
14 | 256532cb82241 |
15 | 109e1d326da85 |
hex | 7b37b6b21051 |
135479218540625 has 24 divisors (see below), whose sum is σ = 169340256764280. Its totient is φ = 108382048720000.
The previous prime is 135479218540609. The next prime is 135479218540681. The reversal of 135479218540625 is 526045812974531.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 131506400205376 + 3972818335249 = 11467624^2 + 1993193^2 .
It is not a de Polignac number, because 135479218540625 - 24 = 135479218540609 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 315213371 + ... + 315642879.
It is an arithmetic number, because the mean of its divisors is an integer number (7055844031845).
It is a 1-persistent number, because it is pandigital, but 2⋅135479218540625 = 270958437081250 is not.
Almost surely, 2135479218540625 is an apocalyptic number.
It is an amenable number.
135479218540625 is a deficient number, since it is larger than the sum of its proper divisors (33861038223655).
135479218540625 is an frugal number, since it uses more digits than its factorization.
135479218540625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530471 (or 530451 counting only the distinct ones).
The product of its (nonzero) digits is 72576000, while the sum is 62.
The spelling of 135479218540625 in words is "one hundred thirty-five trillion, four hundred seventy-nine billion, two hundred eighteen million, five hundred forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •