Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …011111011000101010111111 |
3 | 111021001002000202122211210121 |
4 | 112333200102133120222333 |
5 | 101223231322140000211 |
6 | 555022204432515411 |
7 | 30204516102001141 |
oct | 2677402237305277 |
9 | 437032022584717 |
10 | 101121020234431 |
11 | 2a24720278043a |
12 | b411b210abb67 |
13 | 4456895a9c052 |
14 | 1ad83d7c98c91 |
15 | ba55ca868271 |
hex | 5bf8127d8abf |
101121020234431 has 2 divisors, whose sum is σ = 101121020234432. Its totient is φ = 101121020234430.
The previous prime is 101121020234393. The next prime is 101121020234459. The reversal of 101121020234431 is 134432020121101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101121020234431 - 27 = 101121020234303 is a prime.
It is a super-2 number, since 2×1011210202344312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101121020234396 and 101121020234405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101121080234431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560510117215 + 50560510117216.
It is an arithmetic number, because the mean of its divisors is an integer number (50560510117216).
Almost surely, 2101121020234431 is an apocalyptic number.
101121020234431 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121020234431 is an equidigital number, since it uses as much as digits as its factorization.
101121020234431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101121020234431 its reverse (134432020121101), we get a palindrome (235553040355532).
The spelling of 101121020234431 in words is "one hundred one trillion, one hundred twenty-one billion, twenty million, two hundred thirty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.179 sec. • engine limits •