Search a number
-
+
91269843761 is a prime number
BaseRepresentation
bin101010100000000011…
…0110100101100110001
322201120202022110021202
41111000012310230301
52443410040000021
6105532341300545
76410515604645
oct1250006645461
9281522273252
1091269843761
11357864a1548
1215832104755
1387b6c2c115
1445bb80cc25
152592ab1a0b
hex15401b4b31

91269843761 has 2 divisors, whose sum is σ = 91269843762. Its totient is φ = 91269843760.

The previous prime is 91269843737. The next prime is 91269843823. The reversal of 91269843761 is 16734896219.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89688270400 + 1581573361 = 299480^2 + 39769^2 .

It is a cyclic number.

It is not a de Polignac number, because 91269843761 - 26 = 91269843697 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 91269843697 and 91269843706.

It is not a weakly prime, because it can be changed into another prime (91269843061) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45634921880 + 45634921881.

It is an arithmetic number, because the mean of its divisors is an integer number (45634921881).

Almost surely, 291269843761 is an apocalyptic number.

It is an amenable number.

91269843761 is a deficient number, since it is larger than the sum of its proper divisors (1).

91269843761 is an equidigital number, since it uses as much as digits as its factorization.

91269843761 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 3919104, while the sum is 56.

The spelling of 91269843761 in words is "ninety-one billion, two hundred sixty-nine million, eight hundred forty-three thousand, seven hundred sixty-one".