Search a number
-
+
1150621531 is a prime number
BaseRepresentation
bin100010010010101…
…0001011101011011
32222012002122000021
41010211101131123
54324024342111
6310101451311
740341056503
oct10445213533
92865078007
101150621531
1154054aa94
12281410b37
131544c5c57
14acb58a03
156b034d71
hex4495175b

1150621531 has 2 divisors, whose sum is σ = 1150621532. Its totient is φ = 1150621530.

The previous prime is 1150621501. The next prime is 1150621541. The reversal of 1150621531 is 1351260511.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1150621531 - 27 = 1150621403 is a prime.

It is a super-2 number, since 2×11506215312 = 2647859815201567922, which contains 22 as substring.

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

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

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

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

Almost surely, 21150621531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 25.

The square root of 1150621531 is about 33920.8126524115. The cubic root of 1150621531 is about 1047.8782645513.

The spelling of 1150621531 in words is "one billion, one hundred fifty million, six hundred twenty-one thousand, five hundred thirty-one".