Base | Representation |
---|---|
bin | 11001000010011110001011… |
… | …101100000111101110000001 |
3 | 112102220110120112101211212011 |
4 | 121002132023230013232001 |
5 | 103413210312041213441 |
6 | 1030112521010132521 |
7 | 32123660200433305 |
oct | 3102361354075601 |
9 | 472813515354764 |
10 | 110121010101121 |
11 | 320a7070398228 |
12 | 10426233581141 |
13 | 495a49c8215a6 |
14 | 1d29c574a3d05 |
15 | cae7781e2581 |
hex | 64278bb07b81 |
110121010101121 has 2 divisors, whose sum is σ = 110121010101122. Its totient is φ = 110121010101120.
The previous prime is 110121010101101. The next prime is 110121010101149. The reversal of 110121010101121 is 121101010121011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68980267150096 + 41140742951025 = 8305436^2 + 6414105^2 .
It is an emirp because it is prime and its reverse (121101010121011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110121010101121 - 29 = 110121010100609 is a prime.
It is not a weakly prime, because it can be changed into another prime (110121010101101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060505050560 + 55060505050561.
It is an arithmetic number, because the mean of its divisors is an integer number (55060505050561).
Almost surely, 2110121010101121 is an apocalyptic number.
It is an amenable number.
110121010101121 is a deficient number, since it is larger than the sum of its proper divisors (1).
110121010101121 is an equidigital number, since it uses as much as digits as its factorization.
110121010101121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110121010101121 its reverse (121101010121011), we get a palindrome (231222020222132).
The spelling of 110121010101121 in words is "one hundred ten trillion, one hundred twenty-one billion, ten million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •