Base | Representation |
---|---|
bin | 11101110010111101011001… |
… | …110001001011000110010111 |
3 | 122011222210201000101000221102 |
4 | 131302331121301023012113 |
5 | 114134021134311342444 |
6 | 1142413205214140315 |
7 | 36413464352445542 |
oct | 3562753161130627 |
9 | 564883630330842 |
10 | 131045253230999 |
11 | 38833a86119388 |
12 | 128455461b169b |
13 | 581768c066093 |
14 | 24508a4751859 |
15 | 1023bc3abe84e |
hex | 772f59c4b197 |
131045253230999 has 2 divisors, whose sum is σ = 131045253231000. Its totient is φ = 131045253230998.
The previous prime is 131045253230959. The next prime is 131045253231017. The reversal of 131045253230999 is 999032352540131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131045253230999 - 212 = 131045253226903 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131045253230959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65522626615499 + 65522626615500.
It is an arithmetic number, because the mean of its divisors is an integer number (65522626615500).
Almost surely, 2131045253230999 is an apocalyptic number.
131045253230999 is a deficient number, since it is larger than the sum of its proper divisors (1).
131045253230999 is an equidigital number, since it uses as much as digits as its factorization.
131045253230999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7873200, while the sum is 56.
The spelling of 131045253230999 in words is "one hundred thirty-one trillion, forty-five billion, two hundred fifty-three million, two hundred thirty thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •