Base | Representation |
---|---|
bin | 10110111011110110… |
… | …01000101000001001 |
3 | 1011210010110102120110 |
4 | 23131323020220021 |
5 | 200204134414121 |
6 | 5353454344533 |
7 | 614063324442 |
oct | 133573105011 |
9 | 34703412513 |
10 | 12313201161 |
11 | 5249532308 |
12 | 24777bb149 |
13 | 1213005261 |
14 | 84b46a2c9 |
15 | 4c0edad76 |
hex | 2ddec8a09 |
12313201161 has 16 divisors (see below), whose sum is σ = 17353413440. Its totient is φ = 7744481280.
The previous prime is 12313201151. The next prime is 12313201163. The reversal of 12313201161 is 16110231321.
12313201161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12313201161 - 211 = 12313199113 is a prime.
It is a super-2 number, since 2×123132011612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12313201163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 434440 + ... + 461913.
It is an arithmetic number, because the mean of its divisors is an integer number (1084588340).
Almost surely, 212313201161 is an apocalyptic number.
It is an amenable number.
12313201161 is a deficient number, since it is larger than the sum of its proper divisors (5040212279).
12313201161 is a wasteful number, since it uses less digits than its factorization.
12313201161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896616.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12313201161 its reverse (16110231321), we get a palindrome (28423432482).
The spelling of 12313201161 in words is "twelve billion, three hundred thirteen million, two hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •