Base | Representation |
---|---|
bin | 101111110100111001011000… |
… | …111110110101111001100011 |
3 | 1000120202121121202010221220100 |
4 | 233310321120332311321203 |
5 | 210032230404113114021 |
6 | 2023210201500313443 |
7 | 62206540052150142 |
oct | 5764713076657143 |
9 | 1016677552127810 |
10 | 210343221223011 |
11 | 61027071820188 |
12 | 1b711b13242883 |
13 | 904a385788076 |
14 | 39d29481b3759 |
15 | 194b79ad69626 |
hex | bf4e58fb5e63 |
210343221223011 has 6 divisors (see below), whose sum is σ = 303829097322140. Its totient is φ = 140228814148668.
The previous prime is 210343221223007. The next prime is 210343221223027. The reversal of 210343221223011 is 110322122343012.
210343221223011 is a `hidden beast` number, since 2 + 1 + 0 + 3 + 432 + 2 + 1 + 223 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 210343221223011 - 22 = 210343221223007 is a prime.
It is a super-2 number, since 2×2103432212230112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210343221228011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11685734512381 + ... + 11685734512398.
Almost surely, 2210343221223011 is an apocalyptic number.
210343221223011 is a deficient number, since it is larger than the sum of its proper divisors (93485876099129).
210343221223011 is a wasteful number, since it uses less digits than its factorization.
210343221223011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23371469024785 (or 23371469024782 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 210343221223011 its reverse (110322122343012), we get a palindrome (320665343566023).
The spelling of 210343221223011 in words is "two hundred ten trillion, three hundred forty-three billion, two hundred twenty-one million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •