Base | Representation |
---|---|
bin | 1011101101111101111… |
… | …1110011000111100111 |
3 | 201020122012121200020011 |
4 | 2323133133303013213 |
5 | 11244244421310011 |
6 | 232252334351051 |
7 | 20354565021523 |
oct | 2733737630747 |
9 | 636565550204 |
10 | 201318150631 |
11 | 78418936294 |
12 | 3302505b487 |
13 | 15ca4440870 |
14 | 9a5b1a8d83 |
15 | 538404c621 |
hex | 2edf7f31e7 |
201318150631 has 8 divisors (see below), whose sum is σ = 217570258640. Its totient is φ = 185175484992.
The previous prime is 201318150617. The next prime is 201318150643. The reversal of 201318150631 is 136051813102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201318150631 - 213 = 201318142439 is a prime.
It is a super-2 number, since 2×2013181506312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201318150593 and 201318150602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201318150661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27356766 + ... + 27364123.
It is an arithmetic number, because the mean of its divisors is an integer number (27196282330).
Almost surely, 2201318150631 is an apocalyptic number.
201318150631 is a deficient number, since it is larger than the sum of its proper divisors (16252108009).
201318150631 is a wasteful number, since it uses less digits than its factorization.
201318150631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54721185.
The product of its (nonzero) digits is 4320, while the sum is 31.
Adding to 201318150631 its reverse (136051813102), we get a palindrome (337369963733).
The spelling of 201318150631 in words is "two hundred one billion, three hundred eighteen million, one hundred fifty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •