Search a number
-
+
153170106049 is a prime number
BaseRepresentation
bin1000111010100110100…
…1100101011011000001
3112122100200120120211201
42032221221211123001
510002143021343144
6154210530541201
714031461263642
oct2165151453301
9478320516751
10153170106049
1159a60593804
1225828437801
13115a028235c
1475b07d76c9
153eb70751d4
hex23a9a656c1

153170106049 has 2 divisors, whose sum is σ = 153170106050. Its totient is φ = 153170106048.

The previous prime is 153170106041. The next prime is 153170106071. The reversal of 153170106049 is 940601071351.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 149073210000 + 4096896049 = 386100^2 + 64007^2 .

It is a cyclic number.

It is not a de Polignac number, because 153170106049 - 23 = 153170106041 is a prime.

It is a super-2 number, since 2×1531701060492 (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2153170106049 is an apocalyptic number.

It is an amenable number.

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

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

153170106049 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 22680, while the sum is 37.

The spelling of 153170106049 in words is "one hundred fifty-three billion, one hundred seventy million, one hundred six thousand, forty-nine".