Base | Representation |
---|---|
bin | 1100000100111… |
… | …00011011001011 |
3 | 21001121202222102 |
4 | 12002130123023 |
5 | 201413212021 |
6 | 14015144015 |
7 | 2340032654 |
oct | 602343313 |
9 | 231552872 |
10 | 101304011 |
11 | 52202226 |
12 | 29b1500b |
13 | 17cac203 |
14 | d65052b |
15 | 8d6100b |
hex | 609c6cb |
101304011 has 8 divisors (see below), whose sum is σ = 102184464. Its totient is φ = 100427040.
The previous prime is 101303999. The next prime is 101304017. The reversal of 101304011 is 110403101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101304011 - 26 = 101303947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101303983 and 101304001.
It is not an unprimeable number, because it can be changed into a prime (101304017) 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 7 ways as a sum of consecutive naturals, for example, 122981 + ... + 123801.
It is an arithmetic number, because the mean of its divisors is an integer number (12773058).
Almost surely, 2101304011 is an apocalyptic number.
101304011 is a deficient number, since it is larger than the sum of its proper divisors (880453).
101304011 is an equidigital number, since it uses as much as digits as its factorization.
101304011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1741.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 101304011 is about 10064.9893690952. The cubic root of 101304011 is about 466.1677375731.
Adding to 101304011 its reverse (110403101), we get a palindrome (211707112).
It can be divided in two parts, 10130 and 4011, that added together give a palindrome (14141).
The spelling of 101304011 in words is "one hundred one million, three hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •