Base | Representation |
---|---|
bin | 11110010000110111000011… |
… | …011011001100010100010001 |
3 | 122110021020102020222020202000 |
4 | 132100313003123030110101 |
5 | 114421202320134034301 |
6 | 1151025145525544213 |
7 | 40015105402624155 |
oct | 3620670333142421 |
9 | 573236366866660 |
10 | 133100020221201 |
11 | 39456446560540 |
12 | 12b17813575069 |
13 | 593637cb54817 |
14 | 24c210aa9b065 |
15 | 105c384bbd786 |
hex | 790dc36cc511 |
133100020221201 has 32 divisors (see below), whose sum is σ = 215114352637440. Its totient is φ = 80665475605200.
The previous prime is 133100020221199. The next prime is 133100020221209. The reversal of 133100020221201 is 102122020001331.
It is not a de Polignac number, because 133100020221201 - 21 = 133100020221199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133100020221209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16805046 + ... + 23422416.
It is an arithmetic number, because the mean of its divisors is an integer number (6722323519920).
Almost surely, 2133100020221201 is an apocalyptic number.
133100020221201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
133100020221201 is a deficient number, since it is larger than the sum of its proper divisors (82014332416239).
133100020221201 is a wasteful number, since it uses less digits than its factorization.
133100020221201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6685114 (or 6685108 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 133100020221201 its reverse (102122020001331), we get a palindrome (235222040222532).
The spelling of 133100020221201 in words is "one hundred thirty-three trillion, one hundred billion, twenty million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •