Base | Representation |
---|---|
bin | 101111110001010111111011… |
… | …011010011100110001001101 |
3 | 1000112220110202012212212101120 |
4 | 233301113323122130301031 |
5 | 210014244110101430404 |
6 | 2022503043402431153 |
7 | 62153206641166440 |
oct | 5761277332346115 |
9 | 1015813665785346 |
10 | 210101133233229 |
11 | 60a43432426357 |
12 | 1b6930105024b9 |
13 | 90305b4942334 |
14 | 39c4d404c3657 |
15 | 194532c9699d9 |
hex | bf15fb69cc4d |
210101133233229 has 64 divisors (see below), whose sum is σ = 323990212608000. Its totient is φ = 118621279941120.
The previous prime is 210101133233197. The next prime is 210101133233231. The reversal of 210101133233229 is 922332331101012.
It is not a de Polignac number, because 210101133233229 - 25 = 210101133233197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210101133233229.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210101133233249) 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 63 ways as a sum of consecutive naturals, for example, 17536187419 + ... + 17536199399.
It is an arithmetic number, because the mean of its divisors is an integer number (5062347072000).
Almost surely, 2210101133233229 is an apocalyptic number.
It is an amenable number.
210101133233229 is a deficient number, since it is larger than the sum of its proper divisors (113889079374771).
210101133233229 is a wasteful number, since it uses less digits than its factorization.
210101133233229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18218.
The product of its (nonzero) digits is 11664, while the sum is 33.
The spelling of 210101133233229 in words is "two hundred ten trillion, one hundred one billion, one hundred thirty-three million, two hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •