Base | Representation |
---|---|
bin | 1001010010010110111110… |
… | …1011101111101011111011 |
3 | 1100011011101220122202012201 |
4 | 2110211233223233223323 |
5 | 2314244122304013313 |
6 | 33414512415051031 |
7 | 2102502241303264 |
oct | 224455753575373 |
9 | 40134356582181 |
10 | 10211011001083 |
11 | 3287513567312 |
12 | 118ab66b10a77 |
13 | 590b81754449 |
14 | 27430374596b |
15 | 12a929dcb0dd |
hex | 9496faefafb |
10211011001083 has 2 divisors, whose sum is σ = 10211011001084. Its totient is φ = 10211011001082.
The previous prime is 10211011001077. The next prime is 10211011001089. The reversal of 10211011001083 is 38010011011201.
It is a balanced prime because it is at equal distance from previous prime (10211011001077) and next prime (10211011001089).
It is a cyclic number.
It is not a de Polignac number, because 10211011001083 - 237 = 10073572047611 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10211011001083.
It is not a weakly prime, because it can be changed into another prime (10211011001089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105505500541 + 5105505500542.
It is an arithmetic number, because the mean of its divisors is an integer number (5105505500542).
Almost surely, 210211011001083 is an apocalyptic number.
10211011001083 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211011001083 is an equidigital number, since it uses as much as digits as its factorization.
10211011001083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 10211011001083 its reverse (38010011011201), we get a palindrome (48221022012284).
The spelling of 10211011001083 in words is "ten trillion, two hundred eleven billion, eleven million, one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •