Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …010001110000101000111011 |
3 | 111021001002111101012110022011 |
4 | 112333200131101300220323 |
5 | 101223232210002240323 |
6 | 555022234415510351 |
7 | 30204523430200342 |
oct | 2677403521605073 |
9 | 437032441173264 |
10 | 101121201211963 |
11 | 2a247295950549 |
12 | b411b718283b7 |
13 | 44568c4425b4a |
14 | 1ad8413d28b59 |
15 | ba55db6b620d |
hex | 5bf81d470a3b |
101121201211963 has 2 divisors, whose sum is σ = 101121201211964. Its totient is φ = 101121201211962.
The previous prime is 101121201211937. The next prime is 101121201211967. The reversal of 101121201211963 is 369112102121101.
It is a strong prime.
It is an emirp because it is prime and its reverse (369112102121101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101121201211963 is a prime.
It is not a weakly prime, because it can be changed into another prime (101121201211967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560600605981 + 50560600605982.
It is an arithmetic number, because the mean of its divisors is an integer number (50560600605982).
Almost surely, 2101121201211963 is an apocalyptic number.
101121201211963 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121201211963 is an equidigital number, since it uses as much as digits as its factorization.
101121201211963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 101121201211963 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred one million, two hundred eleven thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •