Base | Representation |
---|---|
bin | 101111110001011000110110… |
… | …001110101011010111000011 |
3 | 1000112220120021222122222001112 |
4 | 233301120312032223113003 |
5 | 210014303120210044021 |
6 | 2022503325332353535 |
7 | 62153243252455325 |
oct | 5761306616532703 |
9 | 1015816258588045 |
10 | 210102120003011 |
11 | 60a43899433075 |
12 | 1b693246a758ab |
13 | 90307111c9592 |
14 | 39c4dd5589615 |
15 | 19453893d5d5b |
hex | bf16363ab5c3 |
210102120003011 has 8 divisors (see below), whose sum is σ = 217358214921120. Its totient is φ = 202846771366848.
The previous prime is 210102120003001. The next prime is 210102120003029. The reversal of 210102120003011 is 110300021201012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210102120003011 - 222 = 210102115808707 is a prime.
It is a super-2 number, since 2×2101021200030112 (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 (210102120003001) 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, 185997671 + ... + 187123856.
It is an arithmetic number, because the mean of its divisors is an integer number (27169776865140).
Almost surely, 2210102120003011 is an apocalyptic number.
210102120003011 is a deficient number, since it is larger than the sum of its proper divisors (7256094918109).
210102120003011 is a wasteful number, since it uses less digits than its factorization.
210102120003011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373140973.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 210102120003011 its reverse (110300021201012), we get a palindrome (320402141204023).
The spelling of 210102120003011 in words is "two hundred ten trillion, one hundred two billion, one hundred twenty million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •