Base | Representation |
---|---|
bin | 11101011011100001101… |
… | …00011111000000000101 |
3 | 10120200002222020120211220 |
4 | 32231300310133000011 |
5 | 113031424242334341 |
6 | 2052313222150553 |
7 | 133025505132126 |
oct | 16556064370005 |
9 | 3520088216756 |
10 | 1011210121221 |
11 | 35a940829993 |
12 | 143b90282459 |
13 | 744838b2271 |
14 | 36d2b1b204d |
15 | 1b4859ada66 |
hex | eb70d1f005 |
1011210121221 has 16 divisors (see below), whose sum is σ = 1381039182336. Its totient is φ = 657792472176.
The previous prime is 1011210121169. The next prime is 1011210121237. The reversal of 1011210121221 is 1221210121101.
It is a happy number.
It is not a de Polignac number, because 1011210121221 - 213 = 1011210113029 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1011210121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011210121021) 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, 3860395 + ... + 4114008.
It is an arithmetic number, because the mean of its divisors is an integer number (86314948896).
Almost surely, 21011210121221 is an apocalyptic number.
It is an amenable number.
1011210121221 is a deficient number, since it is larger than the sum of its proper divisors (369829061115).
1011210121221 is an equidigital number, since it uses as much as digits as its factorization.
1011210121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7975432.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1011210121221 its reverse (1221210121101), we get a palindrome (2232420242322).
The spelling of 1011210121221 in words is "one trillion, eleven billion, two hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •