Base | Representation |
---|---|
bin | 100101100111111… |
… | …001011111100101 |
3 | 1121222202002201010 |
4 | 211213321133211 |
5 | 2243042403401 |
6 | 142345052433 |
7 | 21433151115 |
oct | 4547713745 |
9 | 1558662633 |
10 | 631216101 |
11 | 2a4339aaa |
12 | 157487119 |
13 | a0a08269 |
14 | 5db91045 |
15 | 3a636ed6 |
hex | 259f97e5 |
631216101 has 8 divisors (see below), whose sum is σ = 841876000. Its totient is φ = 420683472.
The previous prime is 631216093. The next prime is 631216109. The reversal of 631216101 is 101612136.
It is an interprime number because it is at equal distance from previous prime (631216093) and next prime (631216109).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 631216101 - 23 = 631216093 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 (631216109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19570 + ... + 40563.
It is an arithmetic number, because the mean of its divisors is an integer number (105234500).
Almost surely, 2631216101 is an apocalyptic number.
It is an amenable number.
631216101 is a deficient number, since it is larger than the sum of its proper divisors (210659899).
631216101 is a wasteful number, since it uses less digits than its factorization.
631216101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63635.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 631216101 is about 25124.0144284308. The cubic root of 631216101 is about 857.8131300097.
Adding to 631216101 its reverse (101612136), we get a palindrome (732828237).
The spelling of 631216101 in words is "six hundred thirty-one million, two hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •