Base | Representation |
---|---|
bin | 1100000000010… |
… | …01001101100111 |
3 | 21000111010211211 |
4 | 12000021031213 |
5 | 201234413111 |
6 | 13554212251 |
7 | 2331642004 |
oct | 600111547 |
9 | 230433754 |
10 | 100701031 |
11 | 519301a2 |
12 | 29884087 |
13 | 17b2a912 |
14 | d5348ab |
15 | 8c92521 |
hex | 6009367 |
100701031 has 4 divisors (see below), whose sum is σ = 101222992. Its totient is φ = 100179072.
The previous prime is 100701001. The next prime is 100701037. The reversal of 100701031 is 130107001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130107001 = 17 ⋅7653353.
It is a cyclic number.
It is not a de Polignac number, because 100701031 - 27 = 100700903 is a prime.
It is a super-2 number, since 2×1007010312 = 20281395288925922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100701037) 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, 260691 + ... + 261076.
It is an arithmetic number, because the mean of its divisors is an integer number (25305748).
Almost surely, 2100701031 is an apocalyptic number.
100701031 is a deficient number, since it is larger than the sum of its proper divisors (521961).
100701031 is an equidigital number, since it uses as much as digits as its factorization.
100701031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521960.
The product of its (nonzero) digits is 21, while the sum is 13.
The square root of 100701031 is about 10034.9903338269. The cubic root of 100701031 is about 465.2409912035.
Adding to 100701031 its reverse (130107001), we get a palindrome (230808032).
The spelling of 100701031 in words is "one hundred million, seven hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •