Base | Representation |
---|---|
bin | 11110011110001001011101… |
… | …000100011101100011101101 |
3 | 122120111112022112000221112111 |
4 | 132132021131010131203231 |
5 | 120031132343020124100 |
6 | 1153004441003204021 |
7 | 40141062213433351 |
oct | 3636113504354355 |
9 | 576445275027474 |
10 | 134013131020525 |
11 | 39778716822979 |
12 | 13044786516611 |
13 | 59a14cb937743 |
14 | 25143ad411461 |
15 | 1075ec82366ba |
hex | 79e25d11d8ed |
134013131020525 has 6 divisors (see below), whose sum is σ = 166176282465482. Its totient is φ = 107210504816400.
The previous prime is 134013131020481. The next prime is 134013131020543. The reversal of 134013131020525 is 525020131310431.
It can be written as a sum of positive squares in 3 ways, for example, as 27647468383396 + 106365662637129 = 5258086^2 + 10313373^2 .
It is not a de Polignac number, because 134013131020525 - 219 = 134013130496237 is a prime.
It is a super-3 number, since 3×1340131310205253 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2680262620386 + ... + 2680262620435.
Almost surely, 2134013131020525 is an apocalyptic number.
It is an amenable number.
134013131020525 is a deficient number, since it is larger than the sum of its proper divisors (32163151444957).
134013131020525 is an equidigital number, since it uses as much as digits as its factorization.
134013131020525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5360525240831 (or 5360525240826 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 134013131020525 its reverse (525020131310431), we get a palindrome (659033262330956).
The spelling of 134013131020525 in words is "one hundred thirty-four trillion, thirteen billion, one hundred thirty-one million, twenty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •