Base | Representation |
---|---|
bin | 101101101101011001111010… |
… | …111001011011001000111101 |
3 | 222100210111111201022220202202 |
4 | 231231121322321123020331 |
5 | 202322203123042132201 |
6 | 1551320544133201245 |
7 | 60226050554202224 |
oct | 5555317271331075 |
9 | 870714451286682 |
10 | 201032301130301 |
11 | 590673580a5553 |
12 | 1a6694a6a90225 |
13 | 882335959c274 |
14 | 379002dd59cbb |
15 | 18394a1475c6b |
hex | b6d67ae5b23d |
201032301130301 has 32 divisors (see below), whose sum is σ = 214785904988160. Its totient is φ = 187496550614016.
The previous prime is 201032301130289. The next prime is 201032301130321. The reversal of 201032301130301 is 103031103230102.
It is a de Polignac number, because none of the positive numbers 2k-201032301130301 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 (201032301130321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8890109471 + ... + 8890132083.
It is an arithmetic number, because the mean of its divisors is an integer number (6712059530880).
Almost surely, 2201032301130301 is an apocalyptic number.
It is an amenable number.
201032301130301 is a deficient number, since it is larger than the sum of its proper divisors (13753603857859).
201032301130301 is a wasteful number, since it uses less digits than its factorization.
201032301130301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27413.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 201032301130301 its reverse (103031103230102), we get a palindrome (304063404360403).
The spelling of 201032301130301 in words is "two hundred one trillion, thirty-two billion, three hundred one million, one hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •