Base | Representation |
---|---|
bin | 10010110111110110… |
… | …10111010010001001 |
3 | 222011010120021010201 |
4 | 21123323113102021 |
5 | 131222322114423 |
6 | 4353224412201 |
7 | 506041322035 |
oct | 113373272211 |
9 | 28133507121 |
10 | 10132223113 |
11 | 432a415211 |
12 | 1b69317061 |
13 | c56203abc |
14 | 6c19411c5 |
15 | 3e47ca2ad |
hex | 25bed7489 |
10132223113 has 12 divisors (see below), whose sum is σ = 10579002588. Its totient is φ = 9698474240.
The previous prime is 10132223093. The next prime is 10132223147. The reversal of 10132223113 is 31132223101.
It can be written as a sum of positive squares in 6 ways, for example, as 749007424 + 9383215689 = 27368^2 + 96867^2 .
It is not a de Polignac number, because 10132223113 - 233 = 1542288521 is a prime.
It is a super-2 number, since 2×101322231132 (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 (10132223183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71181 + ... + 159157.
It is an arithmetic number, because the mean of its divisors is an integer number (881583549).
Almost surely, 210132223113 is an apocalyptic number.
It is an amenable number.
10132223113 is a deficient number, since it is larger than the sum of its proper divisors (446779475).
10132223113 is an frugal number, since it uses more digits than its factorization.
10132223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88124 (or 88071 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10132223113 its reverse (31132223101), we get a palindrome (41264446214).
The spelling of 10132223113 in words is "ten billion, one hundred thirty-two million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •