Search a number
-
+
102011021022 = 23127133872731
BaseRepresentation
bin101111100000001010…
…1001010011011011110
3100202022022201210110210
41133000111022123132
53132404310133042
6114510242113250
710240633241361
oct1370025123336
9322268653423
10102011021022
113a29861aa49
121792b34b826
139809345301
144d1a1880d8
1529c0a77a9c
hex17c054a6de

102011021022 has 16 divisors (see below), whose sum is σ = 205628516352. Its totient is φ = 33735927960.

The previous prime is 102011021017. The next prime is 102011021023. The reversal of 102011021022 is 220120110201.

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

It is a congruent number.

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

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 in 7 ways as a sum of consecutive naturals, for example, 66935604 + ... + 66937127.

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

Almost surely, 2102011021022 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 133872863.

The product of its (nonzero) digits is 16, while the sum is 12.

Adding to 102011021022 its reverse (220120110201), we get a palindrome (322131131223).

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

Divisors: 1 2 3 6 127 254 381 762 133872731 267745462 401618193 803236386 17001836837 34003673674 51005510511 102011021022