Search a number
-
+
102146130661 = 1993251157889
BaseRepresentation
bin101111100100001100…
…0100100001011100101
3100202122201222002001111
41133020120210023211
53133143402140121
6114531510025021
710244163533131
oct1371030441345
9322581862044
10102146130661
113a357911903
1217968648171
13982b32c743
144d300b83c1
1529cc8652e1
hex17c86242e5

102146130661 has 8 divisors (see below), whose sum is σ = 102691656000. Its totient is φ = 101600928000.

The previous prime is 102146130631. The next prime is 102146130677. The reversal of 102146130661 is 166031641201.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 102146130661 - 27 = 102146130533 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 2102146130661 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 161339.

The product of its (nonzero) digits is 5184, while the sum is 31.

Adding to 102146130661 its reverse (166031641201), we get a palindrome (268177771862).

The spelling of 102146130661 in words is "one hundred two billion, one hundred forty-six million, one hundred thirty thousand, six hundred sixty-one".

Divisors: 1 199 3251 157889 646949 31419911 513297139 102146130661