Search a number
-
+
10100010222 = 232561111679
BaseRepresentation
bin10010110100000000…
…11110110011101110
3222001212221200100200
421122000132303232
5131141100311342
64350114134330
7505200445641
oct113200366356
928055850320
1010100010222
114313213195
121b5a5813a6
13c4c635813
146bb557a58
153e1a6594c
hex25a01ecee

10100010222 has 12 divisors (see below), whose sum is σ = 21883355520. Its totient is φ = 3366670068.

The previous prime is 10100010203. The next prime is 10100010259. The reversal of 10100010222 is 22201000101.

10100010222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 280555822 + ... + 280555857.

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

Almost surely, 210100010222 is an apocalyptic number.

10100010222 is an abundant number, since it is smaller than the sum of its proper divisors (11783345298).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 9.

Adding to 10100010222 its reverse (22201000101), we get a palindrome (32301010323).

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

Divisors: 1 2 3 6 9 18 561111679 1122223358 1683335037 3366670074 5050005111 10100010222