Base | Representation |
---|---|
bin | 111111100001011110… |
… | …0011011001011100100 |
3 | 111001002222010222212202 |
4 | 1333002330123023210 |
5 | 4213334114343202 |
6 | 142400142234032 |
7 | 12566324006504 |
oct | 1770274331344 |
9 | 431088128782 |
10 | 136414606052 |
11 | 5294254164a |
12 | 22530b85918 |
13 | cb2cb2710a |
14 | 68613a1a04 |
15 | 3836097802 |
hex | 1fc2f1b2e4 |
136414606052 has 24 divisors (see below), whose sum is σ = 251316374400. Its totient is φ = 64610679456.
The previous prime is 136414606051. The next prime is 136414606079. The reversal of 136414606052 is 250606414631.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 136414605997 and 136414606015.
It is not an unprimeable number, because it can be changed into a prime (136414606051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 678149 + ... + 855987.
It is an arithmetic number, because the mean of its divisors is an integer number (10471515600).
Almost surely, 2136414606052 is an apocalyptic number.
It is an amenable number.
136414606052 is a deficient number, since it is larger than the sum of its proper divisors (114901768348).
136414606052 is a wasteful number, since it uses less digits than its factorization.
136414606052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187955 (or 187953 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 136414606052 in words is "one hundred thirty-six billion, four hundred fourteen million, six hundred six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •