Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0000110011110010000101 |
3 | 1022210121022101011202102220 |
4 | 2103020213300303302011 |
5 | 2311124332122334341 |
6 | 33300534415322553 |
7 | 2062332334661145 |
oct | 223104760636205 |
9 | 38717271152386 |
10 | 10111020121221 |
11 | 32490722a0318 |
12 | 1173700220459 |
13 | 584607ab8c46 |
14 | 26d5399ba925 |
15 | 128026893a66 |
hex | 93227c33c85 |
10111020121221 has 8 divisors (see below), whose sum is σ = 13946234650080. Its totient is φ = 6508242836592.
The previous prime is 10111020121207. The next prime is 10111020121243. The reversal of 10111020121221 is 12212102011101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10111020121221 - 214 = 10111020104837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10111020121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111020121271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58109310955 + ... + 58109311128.
It is an arithmetic number, because the mean of its divisors is an integer number (1743279331260).
Almost surely, 210111020121221 is an apocalyptic number.
It is an amenable number.
10111020121221 is a deficient number, since it is larger than the sum of its proper divisors (3835214528859).
10111020121221 is a wasteful number, since it uses less digits than its factorization.
10111020121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116218622115.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10111020121221 its reverse (12212102011101), we get a palindrome (22323122132322).
The spelling of 10111020121221 in words is "ten trillion, one hundred eleven billion, twenty million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •