Base | Representation |
---|---|
bin | 101101101101000111001000… |
… | …101111011111100011010101 |
3 | 222100201120110010010212010112 |
4 | 231231013020233133203111 |
5 | 202321340321333011201 |
6 | 1551303410533332405 |
7 | 60224435012114411 |
oct | 5555071057374325 |
9 | 870646403125115 |
10 | 201012132313301 |
11 | 59059848351851 |
12 | 1a6655b8497105 |
13 | 8821493c3791a |
14 | 378d07948bd41 |
15 | 1838bc09b00bb |
hex | b6d1c8bdf8d5 |
201012132313301 has 8 divisors (see below), whose sum is σ = 216013037711040. Its totient is φ = 186364189395648.
The previous prime is 201012132313259. The next prime is 201012132313331. The reversal of 201012132313301 is 103313231210102.
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 201012132313301 - 226 = 201012065204437 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201012132313331) 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, 88240618841 + ... + 88240621118.
It is an arithmetic number, because the mean of its divisors is an integer number (27001629713880).
Almost surely, 2201012132313301 is an apocalyptic number.
It is an amenable number.
201012132313301 is a deficient number, since it is larger than the sum of its proper divisors (15000905397739).
201012132313301 is a wasteful number, since it uses less digits than its factorization.
201012132313301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176481240043.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 201012132313301 its reverse (103313231210102), we get a palindrome (304325363523403).
The spelling of 201012132313301 in words is "two hundred one trillion, twelve billion, one hundred thirty-two million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •