Base | Representation |
---|---|
bin | 10110110011100110101001… |
… | …110011111010010110010011 |
3 | 111011010220010212122202020112 |
4 | 112303212221303322112103 |
5 | 101121331443334040311 |
6 | 553154355132231535 |
7 | 30061445205405161 |
oct | 2663465163722623 |
9 | 434126125582215 |
10 | 100303220221331 |
11 | 29a613a1a08416 |
12 | b2bb52960b5ab |
13 | 43c772617345a |
14 | 1aaa9b78c4231 |
15 | b8e1b4a2328b |
hex | 5b39a9cfa593 |
100303220221331 has 2 divisors, whose sum is σ = 100303220221332. Its totient is φ = 100303220221330.
The previous prime is 100303220221319. The next prime is 100303220221363. The reversal of 100303220221331 is 133122022303001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100303220221331 is a prime.
It is a super-2 number, since 2×1003032202213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100303220221297 and 100303220221306.
It is not a weakly prime, because it can be changed into another prime (100303220224331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50151610110665 + 50151610110666.
It is an arithmetic number, because the mean of its divisors is an integer number (50151610110666).
Almost surely, 2100303220221331 is an apocalyptic number.
100303220221331 is a deficient number, since it is larger than the sum of its proper divisors (1).
100303220221331 is an equidigital number, since it uses as much as digits as its factorization.
100303220221331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 100303220221331 its reverse (133122022303001), we get a palindrome (233425242524332).
The spelling of 100303220221331 in words is "one hundred trillion, three hundred three billion, two hundred twenty million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •