Base | Representation |
---|---|
bin | 10111001100010101010000… |
… | …111100001000011011100001 |
3 | 111101011100101010120101111202 |
4 | 113030111100330020123201 |
5 | 101332202143240100103 |
6 | 1000535152424250545 |
7 | 30325303636350344 |
oct | 2714252074103341 |
9 | 441140333511452 |
10 | 102002536253153 |
11 | 2a55703a572548 |
12 | b534937010a55 |
13 | 44bba4ac90a13 |
14 | 1b28d4046c45b |
15 | bbd4c0289988 |
hex | 5cc550f086e1 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •