Base | Representation |
---|---|
bin | 10110101001100111… |
… | …11111001011110011 |
3 | 1011101110210220020100 |
4 | 23110303333023303 |
5 | 144401021120111 |
6 | 5330354043443 |
7 | 610226056344 |
oct | 132463771363 |
9 | 34343726210 |
10 | 12160332531 |
11 | 51802108a6 |
12 | 2434579583 |
13 | 11ba440749 |
14 | 8350360cb |
15 | 4b2891756 |
hex | 2d4cff2f3 |
12160332531 has 6 divisors (see below), whose sum is σ = 17564924780. Its totient is φ = 8106888348.
The previous prime is 12160332523. The next prime is 12160332539. The reversal of 12160332531 is 13523306121.
12160332531 is a `hidden beast` number, since 1 + 2 + 1 + 603 + 3 + 2 + 53 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (12160332523) and next prime (12160332539).
It is not a de Polignac number, because 12160332531 - 23 = 12160332523 is a prime.
It is a super-2 number, since 2×121603325312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12160332495 and 12160332504.
It is not an unprimeable number, because it can be changed into a prime (12160332539) 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, 675574021 + ... + 675574038.
Almost surely, 212160332531 is an apocalyptic number.
12160332531 is a deficient number, since it is larger than the sum of its proper divisors (5404592249).
12160332531 is a wasteful number, since it uses less digits than its factorization.
12160332531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1351148065 (or 1351148062 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 12160332531 its reverse (13523306121), we get a palindrome (25683638652).
The spelling of 12160332531 in words is "twelve billion, one hundred sixty million, three hundred thirty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •