Search a number
-
+
31201100222 = 215600550111
BaseRepresentation
bin11101000011101110…
…110000000110111110
32222112110101010010112
4131003232300012332
51002344440201342
622200015510022
72153122655525
oct350356600676
988473333115
1031201100222
1112261231446
126069228312
132c331832a6
14171db834bc
15c292d0682
hex743bb01be

31201100222 has 4 divisors (see below), whose sum is σ = 46801650336. Its totient is φ = 15600550110.

The previous prime is 31201100201. The next prime is 31201100237. The reversal of 31201100222 is 22200110213.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 231201100222 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15600550113.

The product of its (nonzero) digits is 48, while the sum is 14.

Adding to 31201100222 its reverse (22200110213), we get a palindrome (53401210435).

Subtracting from 31201100222 its reverse (22200110213), we obtain a palindrome (9000990009).

The spelling of 31201100222 in words is "thirty-one billion, two hundred one million, one hundred thousand, two hundred twenty-two".

Divisors: 1 2 15600550111 31201100222