Base | Representation |
---|---|
bin | 11000100000110100… |
… | …01101111111111011 |
3 | 1020222011020221212000 |
4 | 30100122031333323 |
5 | 203423003213202 |
6 | 10013512552043 |
7 | 644056641300 |
oct | 142032157773 |
9 | 36864227760 |
10 | 13160210427 |
11 | 5643660971 |
12 | 26733b2623 |
13 | 1319637180 |
14 | 8cbb510a7 |
15 | 52054b91c |
hex | 31068dffb |
13160210427 has 96 divisors (see below), whose sum is σ = 25213224960. Its totient is φ = 6717453120.
The previous prime is 13160210389. The next prime is 13160210471. The reversal of 13160210427 is 72401206131.
13160210427 is a `hidden beast` number, since 1 + 3 + 1 + 602 + 10 + 42 + 7 = 666.
It is not a de Polignac number, because 13160210427 - 26 = 13160210363 is a prime.
It is a super-2 number, since 2×131602104272 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 13160210427.
It is not an unprimeable number, because it can be changed into a prime (13160210477) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 520828 + ... + 545510.
It is an arithmetic number, because the mean of its divisors is an integer number (262637760).
Almost surely, 213160210427 is an apocalyptic number.
13160210427 is a deficient number, since it is larger than the sum of its proper divisors (12053014533).
13160210427 is a wasteful number, since it uses less digits than its factorization.
13160210427 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24750 (or 24737 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
Adding to 13160210427 its reverse (72401206131), we get a palindrome (85561416558).
The spelling of 13160210427 in words is "thirteen billion, one hundred sixty million, two hundred ten thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •