Base | Representation |
---|---|
bin | 101111110000000100001101… |
… | …010111011000000010110001 |
3 | 1000112120212201102002202120010 |
4 | 233300010031113120002301 |
5 | 210011311004431312423 |
6 | 2022353455401005133 |
7 | 62143545210203010 |
oct | 5760041527300261 |
9 | 1015525642082503 |
10 | 210011240104113 |
11 | 60a092a3069a08 |
12 | 1b6797034837a9 |
13 | 9024c89ccb086 |
14 | 39c0853884a77 |
15 | 1942d1ab9d693 |
hex | bf010d5d80b1 |
210011240104113 has 32 divisors (see below), whose sum is σ = 327830304372480. Its totient is φ = 117076622423040.
The previous prime is 210011240104111. The next prime is 210011240104117. The reversal of 210011240104113 is 311401042110012.
It is not a de Polignac number, because 210011240104113 - 21 = 210011240104111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 210011240104113.
It is not an unprimeable number, because it can be changed into a prime (210011240104111) 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, 33162423 + ... + 38984211.
It is an arithmetic number, because the mean of its divisors is an integer number (10244697011640).
Almost surely, 2210011240104113 is an apocalyptic number.
It is an amenable number.
210011240104113 is a deficient number, since it is larger than the sum of its proper divisors (117819064268367).
210011240104113 is a wasteful number, since it uses less digits than its factorization.
210011240104113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5863737.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 210011240104113 its reverse (311401042110012), we get a palindrome (521412282214125).
The spelling of 210011240104113 in words is "two hundred ten trillion, eleven billion, two hundred forty million, one hundred four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •