Base | Representation |
---|---|
bin | 10111000010010001100001… |
… | …011010111100111011110011 |
3 | 111021201021020021221200011201 |
4 | 113002101201122330323303 |
5 | 101234341042144031311 |
6 | 555245440154152031 |
7 | 30224334013050625 |
oct | 2702214132747363 |
9 | 437637207850151 |
10 | 101311323033331 |
11 | 2a30a988742954 |
12 | b442991122617 |
13 | 446b80306b7b8 |
14 | 1b036cc118c15 |
15 | baa5177e29c1 |
hex | 5c24616bcef3 |
101311323033331 has 2 divisors, whose sum is σ = 101311323033332. Its totient is φ = 101311323033330.
The previous prime is 101311323033311. The next prime is 101311323033377. The reversal of 101311323033331 is 133330323113101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101311323033331 - 213 = 101311323025139 is a prime.
It is a super-2 number, since 2×1013113230333312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101311323033331.
It is not a weakly prime, because it can be changed into another prime (101311323033311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50655661516665 + 50655661516666.
It is an arithmetic number, because the mean of its divisors is an integer number (50655661516666).
Almost surely, 2101311323033331 is an apocalyptic number.
101311323033331 is a deficient number, since it is larger than the sum of its proper divisors (1).
101311323033331 is an equidigital number, since it uses as much as digits as its factorization.
101311323033331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 28.
Adding to 101311323033331 its reverse (133330323113101), we get a palindrome (234641646146432).
The spelling of 101311323033331 in words is "one hundred one trillion, three hundred eleven billion, three hundred twenty-three million, thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •