Base | Representation |
---|---|
bin | 101111110100101111000010… |
… | …001011011100100101110011 |
3 | 1000120201112220202220221022212 |
4 | 233310233002023130211303 |
5 | 210032040120403424021 |
6 | 2023201122224322335 |
7 | 62205664354614212 |
oct | 5764570213344563 |
9 | 1016645822827285 |
10 | 210332101233011 |
11 | 610223858880aa |
12 | 1b70b92b1733ab |
13 | 9049302a3b224 |
14 | 39d21b13cb079 |
15 | 194b3499c785b |
hex | bf4bc22dc973 |
210332101233011 has 2 divisors, whose sum is σ = 210332101233012. Its totient is φ = 210332101233010.
The previous prime is 210332101232987. The next prime is 210332101233017. The reversal of 210332101233011 is 110332101233012.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210332101233011 is a prime.
It is a super-2 number, since 2×2103321012330112 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (210332101233017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105166050616505 + 105166050616506.
It is an arithmetic number, because the mean of its divisors is an integer number (105166050616506).
Almost surely, 2210332101233011 is an apocalyptic number.
210332101233011 is a deficient number, since it is larger than the sum of its proper divisors (1).
210332101233011 is an equidigital number, since it uses as much as digits as its factorization.
210332101233011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 210332101233011 its reverse (110332101233012), we get a palindrome (320664202466023).
Subtracting from 210332101233011 its reverse (110332101233012), we obtain a palindrome (99999999999999).
The spelling of 210332101233011 in words is "two hundred ten trillion, three hundred thirty-two billion, one hundred one million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •