Base | Representation |
---|---|
bin | 11000101110010001… |
… | …11001110111111101 |
3 | 1021021000200221210000 |
4 | 30113020321313331 |
5 | 204140404041221 |
6 | 10033024504513 |
7 | 646630406466 |
oct | 142710716775 |
9 | 37230627700 |
10 | 13273112061 |
11 | 56a1364600 |
12 | 26a517b139 |
13 | 1336b47181 |
14 | 8dcb3dd6d |
15 | 52a3ede26 |
hex | 317239dfd |
13273112061 has 90 divisors (see below), whose sum is σ = 22301067866. Its totient is φ = 7859332800.
The previous prime is 13273112057. The next prime is 13273112089. The reversal of 13273112061 is 16021137231.
13273112061 is a `hidden beast` number, since 1 + 327 + 311 + 20 + 6 + 1 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 1521468036 + 11751644025 = 39006^2 + 108405^2 .
It is not a de Polignac number, because 13273112061 - 22 = 13273112057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13273112261) by changing a digit.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 89081215 + ... + 89081363.
Almost surely, 213273112061 is an apocalyptic number.
13273112061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13273112061 is a deficient number, since it is larger than the sum of its proper divisors (9027955805).
13273112061 is an equidigital number, since it uses as much as digits as its factorization.
13273112061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393 (or 224 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
Adding to 13273112061 its reverse (16021137231), we get a palindrome (29294249292).
The spelling of 13273112061 in words is "thirteen billion, two hundred seventy-three million, one hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •