Base | Representation |
---|---|
bin | 11011100001000101110010… |
… | …111001101011001010010011 |
3 | 120212111111220222200011222001 |
4 | 123201011302321223022103 |
5 | 111330302430113033021 |
6 | 1105220214223454431 |
7 | 34330331452301206 |
oct | 3341056271531223 |
9 | 525444828604861 |
10 | 121021221221011 |
11 | 356198a23a9591 |
12 | 116a6882157417 |
13 | 526b3380b4707 |
14 | 21c565ba5393d |
15 | ded08de66091 |
hex | 6e1172e6b293 |
121021221221011 has 2 divisors, whose sum is σ = 121021221221012. Its totient is φ = 121021221221010.
The previous prime is 121021221220969. The next prime is 121021221221041. The reversal of 121021221221011 is 110122122120121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121021221221011 - 221 = 121021219123859 is a prime.
It is a super-2 number, since 2×1210212212210112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121021221221011.
It is not a weakly prime, because it can be changed into another prime (121021221221041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510610610505 + 60510610610506.
It is an arithmetic number, because the mean of its divisors is an integer number (60510610610506).
Almost surely, 2121021221221011 is an apocalyptic number.
121021221221011 is a deficient number, since it is larger than the sum of its proper divisors (1).
121021221221011 is an equidigital number, since it uses as much as digits as its factorization.
121021221221011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121021221221011 its reverse (110122122120121), we get a palindrome (231143343341132).
The spelling of 121021221221011 in words is "one hundred twenty-one trillion, twenty-one billion, two hundred twenty-one million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •