Search a number
-
+
103220121014 = 251610060507
BaseRepresentation
bin110000000100001100…
…1100000110110110110
3100212102120212102211222
41200020121200312312
53142343322333024
6115230233230342
710312614360263
oct1401031406666
9325376772758
10103220121014
113a85908173a
12180082623b2
13996c9a47aa
144dd29a626a
152a41cae85e
hex1808660db6

103220121014 has 4 divisors (see below), whose sum is σ = 154830181524. Its totient is φ = 51610060506.

The previous prime is 103220121001. The next prime is 103220121071. The reversal of 103220121014 is 410121022301.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 410121022301 = 2801146419501.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2103220121014 is an apocalyptic number.

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

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

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

The sum of its prime factors is 51610060509.

The product of its (nonzero) digits is 96, while the sum is 17.

Adding to 103220121014 its reverse (410121022301), we get a palindrome (513341143315).

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

Divisors: 1 2 51610060507 103220121014