Search a number
-
+
102002536253153 = 3111579284169997
BaseRepresentation
bin10111001100010101010000…
…111100001000011011100001
3111101011100101010120101111202
4113030111100330020123201
5101332202143240100103
61000535152424250545
730325303636350344
oct2714252074103341
9441140333511452
10102002536253153
112a55703a572548
12b534937010a55
1344bba4ac90a13
141b28d4046c45b
15bbd4c0289988
hex5cc550f086e1

102002536253153 has 8 divisors (see below), whose sum is σ = 105302034458880. Its totient is φ = 98703606410640.

The previous prime is 102002536253129. The next prime is 102002536253237. The reversal of 102002536253153 is 351352635200201.

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 102002536253153 - 230 = 102001462511329 is a prime.

It is a super-2 number, since 2×1020025362531532 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141726050 + ... + 142443947.

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

Almost surely, 2102002536253153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 284181607.

The product of its (nonzero) digits is 162000, while the sum is 38.

The spelling of 102002536253153 in words is "one hundred two trillion, two billion, five hundred thirty-six million, two hundred fifty-three thousand, one hundred fifty-three".

Divisors: 1 31 11579 358949 284169997 8809269907 3290404395263 102002536253153