Search a number
-
+
30999684610567 is a prime number
BaseRepresentation
bin1110000110001101011010…
…01100000111101000000111
311001202112121022122202000001
413003012231030013220013
513030344323230014232
6145533020345502131
76346440040361431
oct703065514075007
9131675538582001
1030999684610567
11997198a891222
123587b437a1947
13143b34727c30a
1479256d975651
1538b58d9e16e7
hex1c31ad307a07

30999684610567 has 2 divisors, whose sum is σ = 30999684610568. Its totient is φ = 30999684610566.

The previous prime is 30999684610541. The next prime is 30999684610607. The reversal of 30999684610567 is 76501648699903.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-30999684610567 is a prime.

It is a super-2 number, since 2×309996846105672 (a number of 28 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 30999684610567.

It is a congruent number.

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

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

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

Almost surely, 230999684610567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 529079040, while the sum is 73.

The spelling of 30999684610567 in words is "thirty trillion, nine hundred ninety-nine billion, six hundred eighty-four million, six hundred ten thousand, five hundred sixty-seven".