Base | Representation |
---|---|
bin | 10111000000110101010101… |
… | …000010010110110000110011 |
3 | 111021100210201100222220111211 |
4 | 113000311111002112300303 |
5 | 101231230323214323443 |
6 | 555132145235420551 |
7 | 30214230625541113 |
oct | 2700652502266063 |
9 | 437323640886454 |
10 | 101212331011123 |
11 | 2a2819aa28a452 |
12 | b427764a54757 |
13 | 4462388330527 |
14 | 1adc9bacc1043 |
15 | ba7b71d1319d |
hex | 5c0d55096c33 |
101212331011123 has 2 divisors, whose sum is σ = 101212331011124. Its totient is φ = 101212331011122.
The previous prime is 101212331011061. The next prime is 101212331011189. The reversal of 101212331011123 is 321110133212101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101212331011123 - 225 = 101212297456691 is a prime.
It is a super-2 number, since 2×1012123310111232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101212331011094 and 101212331011103.
It is not a weakly prime, because it can be changed into another prime (101212331611123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606165505561 + 50606165505562.
It is an arithmetic number, because the mean of its divisors is an integer number (50606165505562).
Almost surely, 2101212331011123 is an apocalyptic number.
101212331011123 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212331011123 is an equidigital number, since it uses as much as digits as its factorization.
101212331011123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 101212331011123 its reverse (321110133212101), we get a palindrome (422322464223224).
The spelling of 101212331011123 in words is "one hundred one trillion, two hundred twelve billion, three hundred thirty-one million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •