Base | Representation |
---|---|
bin | 1001001100000001010101… |
… | …0010011000100110110111 |
3 | 1022202202100010102222122220 |
4 | 2103000111102120212313 |
5 | 2311003120234033421 |
6 | 33252503331453423 |
7 | 2061565646036412 |
oct | 223002522304667 |
9 | 38682303388586 |
10 | 10102120221111 |
11 | 3245315559676 |
12 | 1171a37757273 |
13 | 583819cb5a69 |
14 | 26cd339c0b79 |
15 | 127ba538b3c6 |
hex | 930154989b7 |
10102120221111 has 16 divisors (see below), whose sum is σ = 13697986917120. Its totient is φ = 6620503449600.
The previous prime is 10102120221097. The next prime is 10102120221121. The reversal of 10102120221111 is 11112202120101.
It is a happy number.
It is not a de Polignac number, because 10102120221111 - 218 = 10102119958967 is a prime.
It is a super-4 number, since 4×101021202211114 (a number of 53 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102120221121) 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 15 ways as a sum of consecutive naturals, for example, 13222206 + ... + 13965348.
It is an arithmetic number, because the mean of its divisors is an integer number (856124182320).
Almost surely, 210102120221111 is an apocalyptic number.
10102120221111 is a deficient number, since it is larger than the sum of its proper divisors (3595866696009).
10102120221111 is an equidigital number, since it uses as much as digits as its factorization.
10102120221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820006.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10102120221111 its reverse (11112202120101), we get a palindrome (21214322341212).
The spelling of 10102120221111 in words is "ten trillion, one hundred two billion, one hundred twenty million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •