Base | Representation |
---|---|
bin | 11101101111110110010… |
… | …10111100111001000101 |
3 | 10121201021101100212202222 |
4 | 32313323022330321011 |
5 | 113221301011414341 |
6 | 2101320032342125 |
7 | 133563054601031 |
oct | 16677312747105 |
9 | 3551241325688 |
10 | 1022121201221 |
11 | 36452a85387a |
12 | 1461163a4945 |
13 | 75502275413 |
14 | 376843371c1 |
15 | 1b8c383644b |
hex | edfb2bce45 |
1022121201221 has 8 divisors (see below), whose sum is σ = 1066578948864. Its totient is φ = 977664928240.
The previous prime is 1022121201209. The next prime is 1022121201223. The reversal of 1022121201221 is 1221021212201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1022121201221 - 234 = 1004941332037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1022121201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022121201223) 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, 1187540 + ... + 1858626.
It is an arithmetic number, because the mean of its divisors is an integer number (133322368608).
Almost surely, 21022121201221 is an apocalyptic number.
It is an amenable number.
1022121201221 is a deficient number, since it is larger than the sum of its proper divisors (44457747643).
1022121201221 is an equidigital number, since it uses as much as digits as its factorization.
1022121201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737331.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1022121201221 its reverse (1221021212201), we get a palindrome (2243142413422).
The spelling of 1022121201221 in words is "one trillion, twenty-two billion, one hundred twenty-one million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •