103214722 has 12 divisors (see below), whose sum is σ = 167648130. Its totient is φ = 47637408.

The previous prime is 103214711. The next prime is 103214723. The reversal of 103214722 is 227412301.

It can be written as a sum of positive squares in 3 ways, for example, as 56715961 + 46498761 = 7531^2 + 6819^2 .

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

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 152347 + ... + 153022.

Almost surely, 2^103214722 is an apocalyptic number.

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

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

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

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

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

The square root of 103214722 is about 10159.4646512501. The cubic root of 103214722 is about 469.0803232115.

The spelling of 103214722 in words is "one hundred three million, two hundred fourteen thousand, seven hundred twenty-two".