Base | Representation |
---|---|
bin | 11001000011110100000010… |
… | …101001110100110001001101 |
3 | 112110020021112102112020120110 |
4 | 121003310002221310301031 |
5 | 103421213113234114013 |
6 | 1030223124550110233 |
7 | 32133432563261526 |
oct | 3103640251646115 |
9 | 473207472466513 |
10 | 110213200301133 |
11 | 32132179354a76 |
12 | 1044008194b379 |
13 | 49660a23236b7 |
14 | 1d304c120b84d |
15 | cb1d719a22c3 |
hex | 643d02a74c4d |
110213200301133 has 64 divisors (see below), whose sum is σ = 158039195811840. Its totient is φ = 68189032051200.
The previous prime is 110213200301123. The next prime is 110213200301203. The reversal of 110213200301133 is 331103002312011.
It is a happy number.
It is not a de Polignac number, because 110213200301133 - 210 = 110213200300109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110213200301123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4435661916 + ... + 4435686762.
It is an arithmetic number, because the mean of its divisors is an integer number (2469362434560).
Almost surely, 2110213200301133 is an apocalyptic number.
It is an amenable number.
110213200301133 is a deficient number, since it is larger than the sum of its proper divisors (47825995510707).
110213200301133 is a wasteful number, since it uses less digits than its factorization.
110213200301133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44698.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 110213200301133 its reverse (331103002312011), we get a palindrome (441316202613144).
The spelling of 110213200301133 in words is "one hundred ten trillion, two hundred thirteen billion, two hundred million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •