Base | Representation |
---|---|
bin | 10010110111110110… |
… | …10100101001001101 |
3 | 222011010112201022021 |
4 | 21123323110221031 |
5 | 131222321243201 |
6 | 4353224250141 |
7 | 506041245361 |
oct | 113373245115 |
9 | 28133481267 |
10 | 10132212301 |
11 | 432a408082 |
12 | 1b69310951 |
13 | c561cbbc3 |
14 | 6c193b2a1 |
15 | 3e47c6ea1 |
hex | 25bed4a4d |
10132212301 has 24 divisors (see below), whose sum is σ = 10639006560. Its totient is φ = 9644656320.
The previous prime is 10132212253. The next prime is 10132212319. The reversal of 10132212301 is 10321223101.
It is not a de Polignac number, because 10132212301 - 27 = 10132212173 is a prime.
It is a super-3 number, since 3×101322123013 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132212331) 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 23 ways as a sum of consecutive naturals, for example, 16368370 + ... + 16368988.
It is an arithmetic number, because the mean of its divisors is an integer number (443291940).
Almost surely, 210132212301 is an apocalyptic number.
It is an amenable number.
10132212301 is a deficient number, since it is larger than the sum of its proper divisors (506794259).
10132212301 is an frugal number, since it uses more digits than its factorization.
10132212301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 877 (or 816 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10132212301 its reverse (10321223101), we get a palindrome (20453435402).
The spelling of 10132212301 in words is "ten billion, one hundred thirty-two million, two hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •