Base | Representation |
---|---|
bin | 1100000011110… |
… | …00011100010101 |
3 | 21001100021210211 |
4 | 12001320130111 |
5 | 201344003004 |
6 | 14012045421 |
7 | 2335550200 |
oct | 601703425 |
9 | 231307724 |
10 | 101156629 |
11 | 52111522 |
12 | 29a63871 |
13 | 17c5a0c2 |
14 | d612937 |
15 | 8d32504 |
hex | 6078715 |
101156629 has 6 divisors (see below), whose sum is σ = 117672054. Its totient is φ = 86705640.
The previous prime is 101156581. The next prime is 101156677. The reversal of 101156629 is 926651101.
It is an interprime number because it is at equal distance from previous prime (101156581) and next prime (101156677).
It can be written as a sum of positive squares in only one way, i.e., 97970404 + 3186225 = 9898^2 + 1785^2 .
It is not a de Polignac number, because 101156629 - 215 = 101123861 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101156629.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101156129) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1032162 + ... + 1032259.
It is an arithmetic number, because the mean of its divisors is an integer number (19612009).
Almost surely, 2101156629 is an apocalyptic number.
It is an amenable number.
101156629 is a deficient number, since it is larger than the sum of its proper divisors (16515425).
101156629 is an equidigital number, since it uses as much as digits as its factorization.
101156629 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2064435 (or 2064428 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 101156629 is about 10057.6651863144. The cubic root of 101156629 is about 465.9415600240.
The spelling of 101156629 in words is "one hundred one million, one hundred fifty-six thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •