Base | Representation |
---|---|
bin | 11011100000111011100010… |
… | …000010110111100011000011 |
3 | 120212110110110222011221220011 |
4 | 123200323202002313203003 |
5 | 111330112342424001011 |
6 | 1105211152514125351 |
7 | 34326461406046312 |
oct | 3340734202674303 |
9 | 525413428157804 |
10 | 121010201000131 |
11 | 3561515780a523 |
12 | 116a4707580857 |
13 | 526a29cc2a261 |
14 | 21c4cd41dc279 |
15 | decb46730621 |
hex | 6e0ee20b78c3 |
121010201000131 has 2 divisors, whose sum is σ = 121010201000132. Its totient is φ = 121010201000130.
The previous prime is 121010201000093. The next prime is 121010201000147. The reversal of 121010201000131 is 131000102010121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121010201000131 - 215 = 121010200967363 is a prime.
It is a super-2 number, since 2×1210102010001312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121010201000191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60505100500065 + 60505100500066.
It is an arithmetic number, because the mean of its divisors is an integer number (60505100500066).
Almost surely, 2121010201000131 is an apocalyptic number.
121010201000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
121010201000131 is an equidigital number, since it uses as much as digits as its factorization.
121010201000131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 121010201000131 its reverse (131000102010121), we get a palindrome (252010303010252).
The spelling of 121010201000131 in words is "one hundred twenty-one trillion, ten billion, two hundred one million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •