Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …001101111001111000001011 |
3 | 111021001002111022022002211111 |
4 | 112333200131031321320023 |
5 | 101223232204222414402 |
6 | 555022234342111151 |
7 | 30204523415460523 |
oct | 2677403515717013 |
9 | 437032438262744 |
10 | 101121200201227 |
11 | 2a247295320128 |
12 | b411b7141b4b7 |
13 | 44568c4160a8b |
14 | 1ad8413b44683 |
15 | ba55db5669d7 |
hex | 5bf81d379e0b |
101121200201227 has 2 divisors, whose sum is σ = 101121200201228. Its totient is φ = 101121200201226.
The previous prime is 101121200201183. The next prime is 101121200201257. The reversal of 101121200201227 is 722102002121101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101121200201227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101121200201198 and 101121200201207.
It is not a weakly prime, because it can be changed into another prime (101121200201257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560600100613 + 50560600100614.
It is an arithmetic number, because the mean of its divisors is an integer number (50560600100614).
Almost surely, 2101121200201227 is an apocalyptic number.
101121200201227 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121200201227 is an equidigital number, since it uses as much as digits as its factorization.
101121200201227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 101121200201227 its reverse (722102002121101), we get a palindrome (823223202322328).
The spelling of 101121200201227 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred million, two hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •