Search a number
-
+
150467401463 is a prime number
BaseRepresentation
bin1000110000100010001…
…1100101011011110111
3112101101022221222010212
42030020203211123313
54431124123321323
6153042422340035
713604502544511
oct2141043453367
9471338858125
10150467401463
11588a3a1a855
12251b328a61b
131125c35c882
1473d589cbb1
153da9b58b78
hex23088e56f7

150467401463 has 2 divisors, whose sum is σ = 150467401464. Its totient is φ = 150467401462.

The previous prime is 150467401439. The next prime is 150467401471. The reversal of 150467401463 is 364104764051.

150467401463 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 150467401463 - 28 = 150467401207 is a prime.

It is a super-2 number, since 2×1504674014632 (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 150467401463.

It is a congruent number.

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

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

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

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

Almost surely, 2150467401463 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 241920, while the sum is 41.

The spelling of 150467401463 in words is "one hundred fifty billion, four hundred sixty-seven million, four hundred one thousand, four hundred sixty-three".