Base | Representation |
---|---|
bin | 1100000010110… |
… | …01100001110001 |
3 | 21001002212002220 |
4 | 12001121201301 |
5 | 201330430001 |
6 | 14005231253 |
7 | 2334512052 |
oct | 601314161 |
9 | 231085086 |
10 | 101030001 |
11 | 52035376 |
12 | 29a02529 |
13 | 17c14587 |
14 | d5bc729 |
15 | 8d09c36 |
hex | 6059871 |
101030001 has 4 divisors (see below), whose sum is σ = 134706672. Its totient is φ = 67353332.
The previous prime is 101029979. The next prime is 101030009. The reversal of 101030001 is 100030101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101030001 is a prime.
It is a super-2 number, since 2×1010300012 = 20414122204120002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101030009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16838331 + ... + 16838336.
It is an arithmetic number, because the mean of its divisors is an integer number (33676668).
Almost surely, 2101030001 is an apocalyptic number.
It is an amenable number.
101030001 is a deficient number, since it is larger than the sum of its proper divisors (33676671).
101030001 is an equidigital number, since it uses as much as digits as its factorization.
101030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33676670.
The product of its (nonzero) digits is 3, while the sum is 6.
The square root of 101030001 is about 10051.3681158338. The cubic root of 101030001 is about 465.7470567576.
Adding to 101030001 its reverse (100030101), we get a palindrome (201060102).
The spelling of 101030001 in words is "one hundred one million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •