Base | Representation |
---|---|
bin | 10110111111100000011000… |
… | …011100011000111001100111 |
3 | 111021001002021201121011101101 |
4 | 112333200120130120321213 |
5 | 101223232023222042411 |
6 | 555022222401340531 |
7 | 30204521423644102 |
oct | 2677403034307147 |
9 | 437032251534341 |
10 | 101121120112231 |
11 | 2a24725409907a |
12 | b411b4a637747 |
13 | 44568b069c03b |
14 | 1ad8407257739 |
15 | ba55d44e68c1 |
hex | 5bf818718e67 |
101121120112231 has 2 divisors, whose sum is σ = 101121120112232. Its totient is φ = 101121120112230.
The previous prime is 101121120112163. The next prime is 101121120112237. The reversal of 101121120112231 is 132211021121101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101121120112231 - 29 = 101121120111719 is a prime.
It is a super-2 number, since 2×1011211201122312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101121120112199 and 101121120112208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101121120112237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560560056115 + 50560560056116.
It is an arithmetic number, because the mean of its divisors is an integer number (50560560056116).
Almost surely, 2101121120112231 is an apocalyptic number.
101121120112231 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121120112231 is an equidigital number, since it uses as much as digits as its factorization.
101121120112231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 101121120112231 its reverse (132211021121101), we get a palindrome (233332141233332).
The spelling of 101121120112231 in words is "one hundred one trillion, one hundred twenty-one billion, one hundred twenty million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •