Base | Representation |
---|---|
bin | 10111000010100101101111… |
… | …010000111101011010000011 |
3 | 111021210100021002200111122022 |
4 | 113002211233100331122003 |
5 | 101240220021203200311 |
6 | 555303430144432055 |
7 | 30226032644251625 |
oct | 2702455720753203 |
9 | 437710232614568 |
10 | 101333030131331 |
11 | 2a319107842969 |
12 | b44702a91862b |
13 | 447088230969b |
14 | 1b0478b012c15 |
15 | baad883655db |
hex | 5c296f43d683 |
101333030131331 has 2 divisors, whose sum is σ = 101333030131332. Its totient is φ = 101333030131330.
The previous prime is 101333030131297. The next prime is 101333030131387. The reversal of 101333030131331 is 133131030333101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101333030131331 - 222 = 101333025937027 is a prime.
It is a super-2 number, since 2×1013330301313312 (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 101333030131331.
It is not a weakly prime, because it can be changed into another prime (101333030131031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50666515065665 + 50666515065666.
It is an arithmetic number, because the mean of its divisors is an integer number (50666515065666).
Almost surely, 2101333030131331 is an apocalyptic number.
101333030131331 is a deficient number, since it is larger than the sum of its proper divisors (1).
101333030131331 is an equidigital number, since it uses as much as digits as its factorization.
101333030131331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2187, while the sum is 26.
Adding to 101333030131331 its reverse (133131030333101), we get a palindrome (234464060464432).
The spelling of 101333030131331 in words is "one hundred one trillion, three hundred thirty-three billion, thirty million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •