Base | Representation |
---|---|
bin | 1001000110001101001000… |
… | …1111000010000110100101 |
3 | 1022102012110021122202202020 |
4 | 2101203102033002012211 |
5 | 2302334012010134341 |
6 | 33134541410533353 |
7 | 2051431053615306 |
oct | 221432217020645 |
9 | 38365407582666 |
10 | 10002211021221 |
11 | 3206a06400a91 |
12 | 11565b4297259 |
13 | 5772872484c3 |
14 | 268176a387ad |
15 | 1252a90da566 |
hex | 918d23c21a5 |
10002211021221 has 16 divisors (see below), whose sum is σ = 13356196478400. Its totient is φ = 6658185650688.
The previous prime is 10002211021177. The next prime is 10002211021261. The reversal of 10002211021221 is 12212011220001.
It is not a de Polignac number, because 10002211021221 - 27 = 10002211021093 is a prime.
It is a super-4 number, since 4×100022110212214 (a number of 53 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10002211021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002211021261) 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, 15714645 + ... + 16338741.
It is an arithmetic number, because the mean of its divisors is an integer number (834762279900).
Almost surely, 210002211021221 is an apocalyptic number.
It is an amenable number.
10002211021221 is a deficient number, since it is larger than the sum of its proper divisors (3353985457179).
10002211021221 is an equidigital number, since it uses as much as digits as its factorization.
10002211021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 632068.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10002211021221 its reverse (12212011220001), we get a palindrome (22214222241222).
The spelling of 10002211021221 in words is "ten trillion, two billion, two hundred eleven million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •