Base | Representation |
---|---|
bin | 10111000010001001111000… |
… | …101011000111010001000011 |
3 | 111021200111001211112120000121 |
4 | 113002021320223013101003 |
5 | 101234222244020230311 |
6 | 555242002355401111 |
7 | 30223623554524216 |
oct | 2702117053072103 |
9 | 437614054476017 |
10 | 101303123211331 |
11 | 2a3074600a4258 |
12 | b441282bb3197 |
13 | 446aac7304412 |
14 | 1b031510b777d |
15 | baa1d79c5b71 |
hex | 5c2278ac7443 |
101303123211331 has 2 divisors, whose sum is σ = 101303123211332. Its totient is φ = 101303123211330.
The previous prime is 101303123211281. The next prime is 101303123211337. The reversal of 101303123211331 is 133112321303101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101303123211331 - 221 = 101303121114179 is a prime.
It is a super-2 number, since 2×1013031232113312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101303123211296 and 101303123211305.
It is not a weakly prime, because it can be changed into another prime (101303123211337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651561605665 + 50651561605666.
It is an arithmetic number, because the mean of its divisors is an integer number (50651561605666).
Almost surely, 2101303123211331 is an apocalyptic number.
101303123211331 is a deficient number, since it is larger than the sum of its proper divisors (1).
101303123211331 is an equidigital number, since it uses as much as digits as its factorization.
101303123211331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 101303123211331 its reverse (133112321303101), we get a palindrome (234415444514432).
The spelling of 101303123211331 in words is "one hundred one trillion, three hundred three billion, one hundred twenty-three million, two hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •