Base | Representation |
---|---|
bin | 101101110001110001001001… |
… | …011111101110100100111111 |
3 | 222101212011101121110122200111 |
4 | 231301301021133232210333 |
5 | 202342111140211140221 |
6 | 1552110411000410451 |
7 | 60256523422550206 |
oct | 5561611137564477 |
9 | 871764347418614 |
10 | 201332120021311 |
11 | 591725220419a4 |
12 | 1a6b761b776a27 |
13 | 88456caa29296 |
14 | 37a0752dd623d |
15 | 184219ccacbe1 |
hex | b71c497ee93f |
201332120021311 has 24 divisors (see below), whose sum is σ = 210547474447104. Its totient is φ = 192430528874640.
The previous prime is 201332120021299. The next prime is 201332120021363. The reversal of 201332120021311 is 113120021233102.
It is a de Polignac number, because none of the positive numbers 2k-201332120021311 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 (201332123021311) 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 23 ways as a sum of consecutive naturals, for example, 478364476 + ... + 478785166.
It is an arithmetic number, because the mean of its divisors is an integer number (8772811435296).
Almost surely, 2201332120021311 is an apocalyptic number.
201332120021311 is a deficient number, since it is larger than the sum of its proper divisors (9215354425793).
201332120021311 is an equidigital number, since it uses as much as digits as its factorization.
201332120021311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426331 (or 426288 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 201332120021311 its reverse (113120021233102), we get a palindrome (314452141254413).
The spelling of 201332120021311 in words is "two hundred one trillion, three hundred thirty-two billion, one hundred twenty million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •