Base | Representation |
---|---|
bin | 101111110001011001111100… |
… | …101100011001111100101101 |
3 | 1000112220200100101011212000011 |
4 | 233301121330230121330231 |
5 | 210014313030330414013 |
6 | 2022504042523133221 |
7 | 62153314456131145 |
oct | 5761317454317455 |
9 | 1015820311155004 |
10 | 210103302201133 |
11 | 60a44345790010 |
12 | 1b693516974211 |
13 | 903086c0c9cb3 |
14 | 39c50a85a3925 |
15 | 19454080a6c3d |
hex | bf167cb19f2d |
210103302201133 has 16 divisors (see below), whose sum is σ = 229239305057664. Its totient is φ = 190973251906560.
The previous prime is 210103302201103. The next prime is 210103302201151. The reversal of 210103302201133 is 331102203301012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210103302201133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210103302201103) 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 15 ways as a sum of consecutive naturals, for example, 3266143816 + ... + 3266208142.
It is an arithmetic number, because the mean of its divisors is an integer number (14327456566104).
Almost surely, 2210103302201133 is an apocalyptic number.
It is an amenable number.
210103302201133 is a deficient number, since it is larger than the sum of its proper divisors (19136002856531).
210103302201133 is a wasteful number, since it uses less digits than its factorization.
210103302201133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105972.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 210103302201133 its reverse (331102203301012), we get a palindrome (541205505502145).
The spelling of 210103302201133 in words is "two hundred ten trillion, one hundred three billion, three hundred two million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •