Base | Representation |
---|---|
bin | 101101110001011110101100… |
… | …001100001010100100101001 |
3 | 222101210021020101111002220020 |
4 | 231301132230030022210221 |
5 | 202341300043024013001 |
6 | 1552053332214151053 |
7 | 60255222325631661 |
oct | 5561365414124451 |
9 | 871707211432806 |
10 | 201312301001001 |
11 | 59165081794673 |
12 | 1a6b380a352489 |
13 | 884388c9a9428 |
14 | 379d7d2b811a1 |
15 | 18418dcd90736 |
hex | b717ac30a929 |
201312301001001 has 8 divisors (see below), whose sum is σ = 270347454582240. Its totient is φ = 133242674043552.
The previous prime is 201312301000991. The next prime is 201312301001003. The reversal of 201312301001001 is 100100103213102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201312301001001 - 213 = 201312300992809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201312301001003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241381655460 + ... + 241381656293.
It is an arithmetic number, because the mean of its divisors is an integer number (33793431822780).
Almost surely, 2201312301001001 is an apocalyptic number.
It is an amenable number.
201312301001001 is a deficient number, since it is larger than the sum of its proper divisors (69035153581239).
201312301001001 is a wasteful number, since it uses less digits than its factorization.
201312301001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482763311895.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 201312301001001 its reverse (100100103213102), we get a palindrome (301412404214103).
The spelling of 201312301001001 in words is "two hundred one trillion, three hundred twelve billion, three hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •