Base | Representation |
---|---|
bin | 101111110010110101000011… |
… | …001010010001101101110011 |
3 | 1000120021000211112212220112120 |
4 | 233302311003022101231303 |
5 | 210022413344011413021 |
6 | 2023021021215525323 |
7 | 62163346510662543 |
oct | 5762650312215563 |
9 | 1016230745786476 |
10 | 210201121201011 |
11 | 60a81881a93476 |
12 | 1b6aa476229843 |
13 | 9039b5aacb205 |
14 | 39c9b07ad1323 |
15 | 1947c30ac92c6 |
hex | bf2d43291b73 |
210201121201011 has 8 divisors (see below), whose sum is σ = 280456387370640. Its totient is φ = 140039967916032.
The previous prime is 210201121200943. The next prime is 210201121201021. The reversal of 210201121201011 is 110102121102012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210201121201011 - 217 = 210201121069939 is a prime.
It is a super-2 number, since 2×2102011212010112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210201121201021) 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, 23528215950 + ... + 23528224883.
It is an arithmetic number, because the mean of its divisors is an integer number (35057048421330).
Almost surely, 2210201121201011 is an apocalyptic number.
210201121201011 is a deficient number, since it is larger than the sum of its proper divisors (70255266169629).
210201121201011 is a wasteful number, since it uses less digits than its factorization.
210201121201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47056442325.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 210201121201011 its reverse (110102121102012), we get a palindrome (320303242303023).
The spelling of 210201121201011 in words is "two hundred ten trillion, two hundred one billion, one hundred twenty-one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •