Base | Representation |
---|---|
bin | 1001010010011001001011… |
… | …0011011100101110011110 |
3 | 1100011012220222101022220122 |
4 | 2110212102303130232132 |
5 | 2314301324124120014 |
6 | 33415051104114542 |
7 | 2102522654512652 |
oct | 224462263345636 |
9 | 40135828338818 |
10 | 10211600223134 |
11 | 3287796123592 |
12 | 118b0b0305a52 |
13 | 590c4684834b |
14 | 27435bac4a62 |
15 | 12a9619ba58e |
hex | 94992cdcb9e |
10211600223134 has 8 divisors (see below), whose sum is σ = 15317419064160. Its totient is φ = 5105793868416.
The previous prime is 10211600223133. The next prime is 10211600223161. The reversal of 10211600223134 is 43132200611201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×102116002231342 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211600223133) 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, 701894 + ... + 4573385.
It is an arithmetic number, because the mean of its divisors is an integer number (1914677383020).
Almost surely, 210211600223134 is an apocalyptic number.
10211600223134 is a deficient number, since it is larger than the sum of its proper divisors (5105818841026).
10211600223134 is an equidigital number, since it uses as much as digits as its factorization.
10211600223134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6243154.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 10211600223134 its reverse (43132200611201), we get a palindrome (53343800834335).
The spelling of 10211600223134 in words is "ten trillion, two hundred eleven billion, six hundred million, two hundred twenty-three thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •