Base | Representation |
---|---|
bin | 1001010011100001110110… |
… | …1011010110001001000101 |
3 | 1100020002021122110202010020 |
4 | 2110320131223112021011 |
5 | 2320111303130014341 |
6 | 33432035042245353 |
7 | 2104113305056314 |
oct | 224703553261105 |
9 | 40202248422106 |
10 | 10231110001221 |
11 | 3294a9796462a |
12 | 1192a36056859 |
13 | 592a357b2735 |
14 | 27528cc3c27b |
15 | 12b2046a0566 |
hex | 94e1dad6245 |
10231110001221 has 16 divisors (see below), whose sum is σ = 14126806007808. Its totient is φ = 6579491943600.
The previous prime is 10231110001219. The next prime is 10231110001271. The reversal of 10231110001221 is 12210001113201.
It is not a de Polignac number, because 10231110001221 - 21 = 10231110001219 is a prime.
It is a super-2 number, since 2×102311100012212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10231110001221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231110001201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 176839141 + ... + 176896986.
It is an arithmetic number, because the mean of its divisors is an integer number (882925375488).
Almost surely, 210231110001221 is an apocalyptic number.
It is an amenable number.
10231110001221 is a deficient number, since it is larger than the sum of its proper divisors (3895696006587).
10231110001221 is a wasteful number, since it uses less digits than its factorization.
10231110001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353736472.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10231110001221 its reverse (12210001113201), we get a palindrome (22441111114422).
The spelling of 10231110001221 in words is "ten trillion, two hundred thirty-one billion, one hundred ten million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •