Base | Representation |
---|---|
bin | 10110111011110101… |
… | …11110111000111001 |
3 | 1011210010101101212010 |
4 | 23131322332320321 |
5 | 200204132130043 |
6 | 5353453440133 |
7 | 614063100240 |
oct | 133572767071 |
9 | 34703341763 |
10 | 12313161273 |
11 | 5249505346 |
12 | 24777a0049 |
13 | 1212cc005a |
14 | 84b459957 |
15 | 4c0ece133 |
hex | 2ddebee39 |
12313161273 has 16 divisors (see below), whose sum is σ = 18819608576. Its totient is φ = 7014831120.
The previous prime is 12313161271. The next prime is 12313161307. The reversal of 12313161273 is 37216131321.
It is not a de Polignac number, because 12313161273 - 21 = 12313161271 is a prime.
It is a super-2 number, since 2×123131612732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12313161273.
It is not an unprimeable number, because it can be changed into a prime (12313161271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 878761 + ... + 892662.
It is an arithmetic number, because the mean of its divisors is an integer number (1176225536).
Almost surely, 212313161273 is an apocalyptic number.
It is an amenable number.
12313161273 is a deficient number, since it is larger than the sum of its proper divisors (6506447303).
12313161273 is a wasteful number, since it uses less digits than its factorization.
12313161273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1771764.
The product of its digits is 4536, while the sum is 30.
Adding to 12313161273 its reverse (37216131321), we get a palindrome (49529292594).
The spelling of 12313161273 in words is "twelve billion, three hundred thirteen million, one hundred sixty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •