Base | Representation |
---|---|
bin | 10111000000110100000110… |
… | …011111110001100111000011 |
3 | 111021100200022112112102111112 |
4 | 113000310012133301213003 |
5 | 101231220123402320303 |
6 | 555131410405033535 |
7 | 30214153155431300 |
oct | 2700640637614703 |
9 | 437320275472445 |
10 | 101211013323203 |
11 | 2a281393500a73 |
12 | b4274576b58ab |
13 | 4462208341634 |
14 | 1adc8d3cb80a7 |
15 | ba7ae62cc0d8 |
hex | 5c0d067f19c3 |
101211013323203 has 12 divisors (see below), whose sum is σ = 120917294463312. Its totient is φ = 84407640453360.
The previous prime is 101211013323181. The next prime is 101211013323229. The reversal of 101211013323203 is 302323310112101.
It is not a de Polignac number, because 101211013323203 - 222 = 101211009128899 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101211013323253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27912577703 + ... + 27912581328.
It is an arithmetic number, because the mean of its divisors is an integer number (10076441205276).
Almost surely, 2101211013323203 is an apocalyptic number.
101211013323203 is a deficient number, since it is larger than the sum of its proper divisors (19706281140109).
101211013323203 is an equidigital number, since it uses as much as digits as its factorization.
101211013323203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55825159082 (or 55825159075 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 101211013323203 its reverse (302323310112101), we get a palindrome (403534323435304).
The spelling of 101211013323203 in words is "one hundred one trillion, two hundred eleven billion, thirteen million, three hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •