Base | Representation |
---|---|
bin | 11001101001011101… |
… | …00011001111111111 |
3 | 1022112121210002121221 |
4 | 30310232203033333 |
5 | 211144444121002 |
6 | 10154200334211 |
7 | 665135663356 |
oct | 146456431777 |
9 | 38477702557 |
10 | 13769520127 |
11 | 5926598300 |
12 | 2803474367 |
13 | 13b594235c |
14 | 948a3c99d |
15 | 558ca7c37 |
hex | 334ba33ff |
13769520127 has 6 divisors (see below), whose sum is σ = 15135092504. Its totient is φ = 12517745460.
The previous prime is 13769520119. The next prime is 13769520169. The reversal of 13769520127 is 72102596731.
It is not a de Polignac number, because 13769520127 - 23 = 13769520119 is a prime.
It is a super-2 number, since 2×137695201272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13769520197) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56898723 + ... + 56898964.
Almost surely, 213769520127 is an apocalyptic number.
13769520127 is a deficient number, since it is larger than the sum of its proper divisors (1365572377).
13769520127 is a wasteful number, since it uses less digits than its factorization.
13769520127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113797709 (or 113797698 counting only the distinct ones).
The product of its (nonzero) digits is 158760, while the sum is 43.
The spelling of 13769520127 in words is "thirteen billion, seven hundred sixty-nine million, five hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •