Search a number
-
+
103222952131 = 132919664621
BaseRepresentation
bin110000000100010010…
…0010100000011000011
3100212102210012021102011
41200020210110003003
53142400033432011
6115230414033351
710312650421255
oct1401044240303
9325383167364
10103222952131
113a85a735802
12180091a8857
139970456300
144dd3101cd5
152a4216d621
hex18089140c3

103222952131 has 12 divisors (see below), whose sum is σ = 111895759920. Its totient is φ = 95178900960.

The previous prime is 103222952117. The next prime is 103222952141. The reversal of 103222952131 is 131259222301.

It is not a de Polignac number, because 103222952131 - 215 = 103222919363 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (103222952141) 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 11 ways as a sum of consecutive naturals, for example, 177000 + ... + 487621.

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

Almost surely, 2103222952131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 665566 (or 665553 counting only the distinct ones).

The product of its (nonzero) digits is 6480, while the sum is 31.

The spelling of 103222952131 in words is "one hundred three billion, two hundred twenty-two million, nine hundred fifty-two thousand, one hundred thirty-one".

Divisors: 1 13 169 919 11947 155311 664621 8640073 112320949 610786699 7940227087 103222952131