Base | Representation |
---|---|
bin | 1100000010111… |
… | …01111100010001 |
3 | 21001010202220112 |
4 | 12001131330101 |
5 | 201332014311 |
6 | 14005451105 |
7 | 2334615551 |
oct | 601357421 |
9 | 231122815 |
10 | 101048081 |
11 | 52047a12 |
12 | 29a10a95 |
13 | 17c1c884 |
14 | d5c5161 |
15 | 8d1028b |
hex | 605df11 |
101048081 has 2 divisors, whose sum is σ = 101048082. Its totient is φ = 101048080.
The previous prime is 101048071. The next prime is 101048083. The reversal of 101048081 is 180840101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53217025 + 47831056 = 7295^2 + 6916^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101048081 is a prime.
It is a super-2 number, since 2×1010480812 = 20421429347565122, which contains 22 as substring.
Together with 101048083, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101048083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50524040 + 50524041.
It is an arithmetic number, because the mean of its divisors is an integer number (50524041).
Almost surely, 2101048081 is an apocalyptic number.
It is an amenable number.
101048081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101048081 is an equidigital number, since it uses as much as digits as its factorization.
101048081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 23.
The square root of 101048081 is about 10052.2674556540. The cubic root of 101048081 is about 465.7748379593.
Adding to 101048081 its reverse (180840101), we get a palindrome (281888182).
The spelling of 101048081 in words is "one hundred one million, forty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •