Base | Representation |
---|---|
bin | 10111000010010100110011… |
… | …001011001111100111101111 |
3 | 111021201121022112202100112201 |
4 | 113002110303023033213233 |
5 | 101234420244041142202 |
6 | 555251221304442331 |
7 | 30224520143640445 |
oct | 2702246313174757 |
9 | 437647275670481 |
10 | 101314842130927 |
11 | 2a311424123a77 |
12 | b4435b37793a7 |
13 | 446bc44163879 |
14 | 1b03943648b95 |
15 | baa671723387 |
hex | 5c25332cf9ef |
101314842130927 has 2 divisors, whose sum is σ = 101314842130928. Its totient is φ = 101314842130926.
The previous prime is 101314842130903. The next prime is 101314842130939. The reversal of 101314842130927 is 729031248413101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101314842130927 - 239 = 100765086317039 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101314842130427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50657421065463 + 50657421065464.
It is an arithmetic number, because the mean of its divisors is an integer number (50657421065464).
Almost surely, 2101314842130927 is an apocalyptic number.
101314842130927 is a deficient number, since it is larger than the sum of its proper divisors (1).
101314842130927 is an equidigital number, since it uses as much as digits as its factorization.
101314842130927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 46.
The spelling of 101314842130927 in words is "one hundred one trillion, three hundred fourteen billion, eight hundred forty-two million, one hundred thirty thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •