Base | Representation |
---|---|
bin | 101111110100011101100010… |
… | …101111000111110011001001 |
3 | 1000120122202102212220200112020 |
4 | 233310131202233013303021 |
5 | 210031233134421244423 |
6 | 2023144334435435053 |
7 | 62204431062630363 |
oct | 5764354257076311 |
9 | 1016582385820466 |
10 | 210313320103113 |
11 | 61015418383247 |
12 | 1b708169455a89 |
13 | 90475cba33b06 |
14 | 39d130cd47d33 |
15 | 194aaeac734e3 |
hex | bf4762bc7cc9 |
210313320103113 has 8 divisors (see below), whose sum is σ = 280418652101088. Its totient is φ = 140208434086944.
The previous prime is 210313320103087. The next prime is 210313320103123. The reversal of 210313320103113 is 311301023313012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210313320103113 - 28 = 210313320102857 is a prime.
It is a super-2 number, since 2×2103133201031132 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210313320103123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110393556 + ... + 112282517.
It is an arithmetic number, because the mean of its divisors is an integer number (35052331512636).
Almost surely, 2210313320103113 is an apocalyptic number.
It is an amenable number.
210313320103113 is a deficient number, since it is larger than the sum of its proper divisors (70105331997975).
210313320103113 is a wasteful number, since it uses less digits than its factorization.
210313320103113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222990903.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 210313320103113 its reverse (311301023313012), we get a palindrome (521614343416125).
The spelling of 210313320103113 in words is "two hundred ten trillion, three hundred thirteen billion, three hundred twenty million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •