Base | Representation |
---|---|
bin | 101111001000101101… |
… | …1011101000101001101 |
3 | 100200021111002011012012 |
4 | 1132101123131011031 |
5 | 3124301340004013 |
6 | 114300212351005 |
7 | 10212300001043 |
oct | 1362133350515 |
9 | 320244064165 |
10 | 101224141133 |
11 | 39a24430495 |
12 | 1774b915465 |
13 | 97123071cb |
14 | 4c83876393 |
15 | 29769431a8 |
hex | 17916dd14d |
101224141133 has 2 divisors, whose sum is σ = 101224141134. Its totient is φ = 101224141132.
The previous prime is 101224141127. The next prime is 101224141141. The reversal of 101224141133 is 331141422101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70465295209 + 30758845924 = 265453^2 + 175382^2 .
It is a cyclic number.
It is not a de Polignac number, because 101224141133 - 212 = 101224137037 is a prime.
It is a super-2 number, since 2×1012241411332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101224141099 and 101224141108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101224141033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50612070566 + 50612070567.
It is an arithmetic number, because the mean of its divisors is an integer number (50612070567).
Almost surely, 2101224141133 is an apocalyptic number.
It is an amenable number.
101224141133 is a deficient number, since it is larger than the sum of its proper divisors (1).
101224141133 is an equidigital number, since it uses as much as digits as its factorization.
101224141133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 101224141133 its reverse (331141422101), we get a palindrome (432365563234).
The spelling of 101224141133 in words is "one hundred one billion, two hundred twenty-four million, one hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •