Base | Representation |
---|---|
bin | 11110100011000101101001… |
… | …000101100110010000000101 |
3 | 122121200222122010210011120011 |
4 | 132203011221011212100011 |
5 | 120102213144033430003 |
6 | 1153424425401110221 |
7 | 40204441354242310 |
oct | 3643055105462005 |
9 | 577628563704504 |
10 | 134352635061253 |
11 | 398996a5a20714 |
12 | 1309a535788371 |
13 | 59c7525b49a7b |
14 | 25269b8cdb977 |
15 | 107ec48ab146d |
hex | 7a3169166405 |
134352635061253 has 16 divisors (see below), whose sum is σ = 153567531936000. Its totient is φ = 115143155164800.
The previous prime is 134352635061251. The next prime is 134352635061367. The reversal of 134352635061253 is 352160536253431.
It is not a de Polignac number, because 134352635061253 - 21 = 134352635061251 is a prime.
It is a super-4 number, since 4×1343526350612534 (a number of 58 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134352635061197 and 134352635061206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134352635061251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2755305393 + ... + 2755354153.
It is an arithmetic number, because the mean of its divisors is an integer number (9597970746000).
Almost surely, 2134352635061253 is an apocalyptic number.
It is an amenable number.
134352635061253 is a deficient number, since it is larger than the sum of its proper divisors (19214896874747).
134352635061253 is a wasteful number, since it uses less digits than its factorization.
134352635061253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96228.
The product of its (nonzero) digits is 5832000, while the sum is 49.
The spelling of 134352635061253 in words is "one hundred thirty-four trillion, three hundred fifty-two billion, six hundred thirty-five million, sixty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •