Base | Representation |
---|---|
bin | 10111000010100011110110… |
… | …110111001100011001111011 |
3 | 111021210011001022122211211011 |
4 | 113002203312313030121323 |
5 | 101240201402042023344 |
6 | 555302453504414351 |
7 | 30225631615335046 |
oct | 2702436667143173 |
9 | 437704038584734 |
10 | 101331010111099 |
11 | 2a31827057185a |
12 | b4467663173b7 |
13 | 447061c972942 |
14 | 1b04638a25c5d |
15 | baacbad4ad34 |
hex | 5c28f6dcc67b |
101331010111099 has 2 divisors, whose sum is σ = 101331010111100. Its totient is φ = 101331010111098.
The previous prime is 101331010111033. The next prime is 101331010111103. The reversal of 101331010111099 is 990111010133101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101331010111099 - 29 = 101331010110587 is a prime.
It is a super-2 number, since 2×1013310101110992 (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 101331010111099.
It is not a weakly prime, because it can be changed into another prime (101331013111099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665505055549 + 50665505055550.
It is an arithmetic number, because the mean of its divisors is an integer number (50665505055550).
Almost surely, 2101331010111099 is an apocalyptic number.
101331010111099 is a deficient number, since it is larger than the sum of its proper divisors (1).
101331010111099 is an equidigital number, since it uses as much as digits as its factorization.
101331010111099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 31.
The spelling of 101331010111099 in words is "one hundred one trillion, three hundred thirty-one billion, ten million, one hundred eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •