Base | Representation |
---|---|
bin | 1100000110011… |
… | …10000010001101 |
3 | 21002000002201102 |
4 | 12003032002031 |
5 | 201441212323 |
6 | 14023352445 |
7 | 2341540253 |
oct | 603160215 |
9 | 232002642 |
10 | 101507213 |
11 | 52330965 |
12 | 29bb2725 |
13 | 18050852 |
14 | d6a45d3 |
15 | 8da1328 |
hex | 60ce08d |
101507213 has 4 divisors (see below), whose sum is σ = 101853948. Its totient is φ = 101160480.
The previous prime is 101507207. The next prime is 101507239. The reversal of 101507213 is 312705101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 312705101 = 13463 ⋅23227.
It can be written as a sum of positive squares in 2 ways, for example, as 81775849 + 19731364 = 9043^2 + 4442^2 .
It is a cyclic number.
It is not a de Polignac number, because 101507213 - 216 = 101441677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101507713) 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, 172928 + ... + 173513.
It is an arithmetic number, because the mean of its divisors is an integer number (25463487).
Almost surely, 2101507213 is an apocalyptic number.
It is an amenable number.
101507213 is a deficient number, since it is larger than the sum of its proper divisors (346735).
101507213 is an equidigital number, since it uses as much as digits as its factorization.
101507213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346734.
The product of its (nonzero) digits is 210, while the sum is 20.
The square root of 101507213 is about 10075.0788086248. The cubic root of 101507213 is about 466.4792189917.
The spelling of 101507213 in words is "one hundred one million, five hundred seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •