Base | Representation |
---|---|
bin | 1100000111011… |
… | …10111110100001 |
3 | 21002020221210220 |
4 | 12003232332201 |
5 | 202010022040 |
6 | 14030313253 |
7 | 2342641533 |
oct | 603567641 |
9 | 232227726 |
10 | 101642145 |
11 | 52413280 |
12 | 2a058829 |
13 | 1809a0a7 |
14 | d6db853 |
15 | 8dcb2d0 |
hex | 60eefa1 |
101642145 has 32 divisors (see below), whose sum is σ = 182217600. Its totient is φ = 47946240.
The previous prime is 101642141. The next prime is 101642147. The reversal of 101642145 is 541246101.
It is a happy number.
It is not a de Polignac number, because 101642145 - 22 = 101642141 is a prime.
It is a super-3 number, since 3×1016421453 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (101642141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2220 + ... + 14429.
It is an arithmetic number, because the mean of its divisors is an integer number (5694300).
Almost surely, 2101642145 is an apocalyptic number.
101642145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101642145 is a deficient number, since it is larger than the sum of its proper divisors (80575455).
101642145 is a wasteful number, since it uses less digits than its factorization.
101642145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16705.
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 101642145 is about 10081.7729095631. The cubic root of 101642145 is about 466.6858220595.
Adding to 101642145 its reverse (541246101), we get a palindrome (642888246).
It can be divided in two parts, 101 and 642145, that added together give a palindrome (642246).
The spelling of 101642145 in words is "one hundred one million, six hundred forty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •