Base | Representation |
---|---|
bin | 11010010100011100… |
… | …11101001101010101 |
3 | 1100110202110210222101 |
4 | 31022032131031111 |
5 | 212414313034100 |
6 | 10254043202101 |
7 | 1010105523322 |
oct | 151216351525 |
9 | 40422423871 |
10 | 14130205525 |
11 | 5aa1150607 |
12 | 28a4216331 |
13 | 144259a077 |
14 | 9808cbb49 |
15 | 57a7a286a |
hex | 34a39d355 |
14130205525 has 12 divisors (see below), whose sum is σ = 17694937764. Its totient is φ = 11192240000.
The previous prime is 14130205421. The next prime is 14130205637. The reversal of 14130205525 is 52550203141.
It can be written as a sum of positive squares in 6 ways, for example, as 26030404 + 14104175121 = 5102^2 + 118761^2 .
It is a de Polignac number, because none of the positive numbers 2k-14130205525 is a prime.
It is a super-3 number, since 3×141302055253 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14130205493 and 14130205502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2795536 + ... + 2800585.
It is an arithmetic number, because the mean of its divisors is an integer number (1474578147).
Almost surely, 214130205525 is an apocalyptic number.
It is an amenable number.
14130205525 is a deficient number, since it is larger than the sum of its proper divisors (3564732239).
14130205525 is a wasteful number, since it uses less digits than its factorization.
14130205525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5596232 (or 5596227 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 14130205525 its reverse (52550203141), we get a palindrome (66680408666).
The spelling of 14130205525 in words is "fourteen billion, one hundred thirty million, two hundred five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •