Search a number
-
+
101578048963 is a prime number
BaseRepresentation
bin101111010011010000…
…1100000010111000011
3100201012011000112110121
41132212201200113003
53131012440031323
6114355254041111
710224125112226
oct1364641402703
9321164015417
10101578048963
113a0961846a6
121782a349197
13976a72b021
144cb887d5bd
152997a4ea5d
hex17a68605c3

101578048963 has 2 divisors, whose sum is σ = 101578048964. Its totient is φ = 101578048962.

The previous prime is 101578048903. The next prime is 101578049003. The reversal of 101578048963 is 369840875101.

It is a strong prime.

It is an emirp because it is prime and its reverse (369840875101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 101578048963 - 221 = 101575951811 is a prime.

It is a super-2 number, since 2×1015780489632 (a number of 23 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 101578048963.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2101578048963 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1451520, while the sum is 52.

The spelling of 101578048963 in words is "one hundred one billion, five hundred seventy-eight million, forty-eight thousand, nine hundred sixty-three".