Base | Representation |
---|---|
bin | 10110111101101111101100… |
… | …110001111001100010011011 |
3 | 111020121111222121110212022022 |
4 | 112331233230301321202123 |
5 | 101214241230342003042 |
6 | 554450452442445055 |
7 | 30163006223645015 |
oct | 2675575461714233 |
9 | 436544877425268 |
10 | 101000128469147 |
11 | 2a1aaa064a8916 |
12 | b3b260280378b |
13 | 444836ac1251b |
14 | 1ad260a33b1b5 |
15 | ba23a2460cd2 |
hex | 5bdbecc7989b |
101000128469147 has 2 divisors, whose sum is σ = 101000128469148. Its totient is φ = 101000128469146.
The previous prime is 101000128469033. The next prime is 101000128469167. The reversal of 101000128469147 is 741964821000101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101000128469147 - 218 = 101000128207003 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000128469098 and 101000128469107.
It is not a weakly prime, because it can be changed into another prime (101000128469167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500064234573 + 50500064234574.
It is an arithmetic number, because the mean of its divisors is an integer number (50500064234574).
Almost surely, 2101000128469147 is an apocalyptic number.
101000128469147 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000128469147 is an equidigital number, since it uses as much as digits as its factorization.
101000128469147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 44.
Adding to 101000128469147 its reverse (741964821000101), we get a palindrome (842964949469248).
The spelling of 101000128469147 in words is "one hundred one trillion, one hundred twenty-eight million, four hundred sixty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •