Base | Representation |
---|---|
bin | 101101101101100110010000… |
… | …111001000000010110011101 |
3 | 222100211202201101212100002100 |
4 | 231231212100321000112131 |
5 | 202322412244041134323 |
6 | 1551331015234115313 |
7 | 60230030162335500 |
oct | 5555462071002635 |
9 | 870752641770070 |
10 | 201045555021213 |
11 | 59071a39620a01 |
12 | 1a66bb8571bb39 |
13 | 882468c446676 |
14 | 379092a2d5137 |
15 | 18399c9d29943 |
hex | b6d990e4059d |
201045555021213 has 36 divisors (see below), whose sum is σ = 340968353169600. Its totient is φ = 113809499744976.
The previous prime is 201045555021191. The next prime is 201045555021277. The reversal of 201045555021213 is 312120555540102.
201045555021213 is a `hidden beast` number, since 2 + 0 + 10 + 4 + 55 + 550 + 21 + 21 + 3 = 666.
It is not a de Polignac number, because 201045555021213 - 224 = 201045538243997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201045555029213) 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 35 ways as a sum of consecutive naturals, for example, 2130259413 + ... + 2130353786.
It is an arithmetic number, because the mean of its divisors is an integer number (9471343143600).
Almost surely, 2201045555021213 is an apocalyptic number.
It is an amenable number.
201045555021213 is a deficient number, since it is larger than the sum of its proper divisors (139922798148387).
201045555021213 is a wasteful number, since it uses less digits than its factorization.
201045555021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4260613326 (or 4260613316 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 36.
The spelling of 201045555021213 in words is "two hundred one trillion, forty-five billion, five hundred fifty-five million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •