Base | Representation |
---|---|
bin | 1001010011000111111100… |
… | …0100010110111000011011 |
3 | 1100012102022212112221102200 |
4 | 2110301333010112320123 |
5 | 2320003031411410321 |
6 | 33424524515301243 |
7 | 2103446032125015 |
oct | 224617704267033 |
9 | 40172285487380 |
10 | 10224154013211 |
11 | 3292048440906 |
12 | 11916145aa823 |
13 | 5921976494b8 |
14 | 274bcd09b1b5 |
15 | 12ae48b7bd26 |
hex | 94c7f116e1b |
10224154013211 has 48 divisors (see below), whose sum is σ = 16207566815232. Its totient is φ = 6190389691200.
The previous prime is 10224154013201. The next prime is 10224154013263. The reversal of 10224154013211 is 11231045142201.
10224154013211 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 41 + 5 + 401 + 3 + 211 = 666.
It is not a de Polignac number, because 10224154013211 - 218 = 10224153751067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10224154013201) 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 47 ways as a sum of consecutive naturals, for example, 14690955 + ... + 15371156.
It is an arithmetic number, because the mean of its divisors is an integer number (337657641984).
Almost surely, 210224154013211 is an apocalyptic number.
10224154013211 is a deficient number, since it is larger than the sum of its proper divisors (5983412802021).
10224154013211 is a wasteful number, since it uses less digits than its factorization.
10224154013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30062224 (or 30062221 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 10224154013211 its reverse (11231045142201), we get a palindrome (21455199155412).
The spelling of 10224154013211 in words is "ten trillion, two hundred twenty-four billion, one hundred fifty-four million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •