Search a number
-
+
155620102 = 21147150503
BaseRepresentation
bin10010100011010…
…01001100000110
3101211211022122111
421101221030012
5304314320402
623235251234
73566514631
oct1121511406
9354738574
10155620102
117a930760
1244149b1a
1326319001
141694cc18
15d9de9d7
hex9469306

155620102 has 16 divisors (see below), whose sum is σ = 260070912. Its totient is φ = 69230920.

The previous prime is 155620043. The next prime is 155620109. The reversal of 155620102 is 201026551.

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

It is a Harshad number since it is a multiple of its sum of digits (22).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (155620109) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74218 + ... + 76285.

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

Almost surely, 2155620102 is an apocalyptic number.

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

155620102 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 150563.

The product of its (nonzero) digits is 600, while the sum is 22.

The square root of 155620102 is about 12474.7786353105. The cubic root of 155620102 is about 537.8839248760.

Adding to 155620102 its reverse (201026551), we get a palindrome (356646653).

The spelling of 155620102 in words is "one hundred fifty-five million, six hundred twenty thousand, one hundred two".

Divisors: 1 2 11 22 47 94 517 1034 150503 301006 1655533 3311066 7073641 14147282 77810051 155620102