Base | Representation |
---|---|
bin | 10010110111101110… |
… | …11101110010111011 |
3 | 222011001122100100111 |
4 | 21123313131302323 |
5 | 131222041414321 |
6 | 4353150445151 |
7 | 506026534525 |
oct | 113367356273 |
9 | 28131570314 |
10 | 10131201211 |
11 | 432988746a |
12 | 1b68b037b7 |
13 | c55c36921 |
14 | 6c1756a15 |
15 | 3e46775e1 |
hex | 25bdddcbb |
10131201211 has 4 divisors (see below), whose sum is σ = 10199196000. Its totient is φ = 10063206424.
The previous prime is 10131201203. The next prime is 10131201217. The reversal of 10131201211 is 11210213101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11210213101 = 137 ⋅81826373.
It is a cyclic number.
It is not a de Polignac number, because 10131201211 - 23 = 10131201203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131201191 and 10131201200.
It is not an unprimeable number, because it can be changed into a prime (10131201217) 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 3 ways as a sum of consecutive naturals, for example, 33997171 + ... + 33997468.
It is an arithmetic number, because the mean of its divisors is an integer number (2549799000).
Almost surely, 210131201211 is an apocalyptic number.
10131201211 is a deficient number, since it is larger than the sum of its proper divisors (67994789).
10131201211 is an equidigital number, since it uses as much as digits as its factorization.
10131201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67994788.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10131201211 its reverse (11210213101), we get a palindrome (21341414312).
The spelling of 10131201211 in words is "ten billion, one hundred thirty-one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •