Search a number
-
+
103255164231 = 388633883379
BaseRepresentation
bin110000000101001111…
…1001100010101000111
3100212112000210211002220
41200022133030111013
53142431310223411
6115233524303423
710313521262142
oct1401237142507
9325460724086
10103255164231
113a87693717a
1218017b41b73
13997702411b
144dd74c9059
152a44dd2b06
hex180a7cc547

103255164231 has 8 divisors (see below), whose sum is σ = 137689121280. Its totient is φ = 68828991672.

The previous prime is 103255164197. The next prime is 103255164239. The reversal of 103255164231 is 132461552301.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 103255164231 - 26 = 103255164167 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2103255164231 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3892245.

The product of its (nonzero) digits is 21600, while the sum is 33.

The spelling of 103255164231 in words is "one hundred three billion, two hundred fifty-five million, one hundred sixty-four thousand, two hundred thirty-one".

Divisors: 1 3 8863 26589 3883379 11650137 34418388077 103255164231