Base | Representation |
---|---|
bin | 1100000010110… |
… | …01100001111011 |
3 | 21001002212010021 |
4 | 12001121201323 |
5 | 201330430021 |
6 | 14005231311 |
7 | 2334512065 |
oct | 601314173 |
9 | 231085107 |
10 | 101030011 |
11 | 52035385 |
12 | 29a02537 |
13 | 17c14594 |
14 | d5bc735 |
15 | 8d09c41 |
hex | 605987b |
101030011 has 4 divisors (see below), whose sum is σ = 106347400. Its totient is φ = 95712624.
The previous prime is 101030009. The next prime is 101030021. The reversal of 101030011 is 110030101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110030101 = 41 ⋅2683661.
It is a cyclic number.
It is not a de Polignac number, because 101030011 - 21 = 101030009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101029976 and 101030003.
It is not an unprimeable number, because it can be changed into a prime (101030021) 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 in 3 ways as a sum of consecutive naturals, for example, 2658666 + ... + 2658703.
It is an arithmetic number, because the mean of its divisors is an integer number (26586850).
Almost surely, 2101030011 is an apocalyptic number.
101030011 is a deficient number, since it is larger than the sum of its proper divisors (5317389).
101030011 is an equidigital number, since it uses as much as digits as its factorization.
101030011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5317388.
The product of its (nonzero) digits is 3, while the sum is 7.
The square root of 101030011 is about 10051.3686132785. The cubic root of 101030011 is about 465.7470721242.
Adding to 101030011 its reverse (110030101), we get a palindrome (211060112).
The spelling of 101030011 in words is "one hundred one million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •