Base | Representation |
---|---|
bin | 10111001100010101010000… |
… | …111100001000011011100000 |
3 | 111101011100101010120101111201 |
4 | 113030111100330020123200 |
5 | 101332202143240100102 |
6 | 1000535152424250544 |
7 | 30325303636350343 |
oct | 2714252074103340 |
9 | 441140333511451 |
10 | 102002536253152 |
11 | 2a55703a572547 |
12 | b534937010a54 |
13 | 44bba4ac90a12 |
14 | 1b28d4046c45a |
15 | bbd4c0289987 |
hex | 5cc550f086e0 |
102002536253152 has 24 divisors (see below), whose sum is σ = 201769234935912. Its totient is φ = 50759555952000.
The previous prime is 102002536253129. The next prime is 102002536253237. The reversal of 102002536253152 is 251352635200201.
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7553498599 + ... + 7553512102.
It is an arithmetic number, because the mean of its divisors is an integer number (8407051455663).
Almost surely, 2102002536253152 is an apocalyptic number.
It is an amenable number.
102002536253152 is a deficient number, since it is larger than the sum of its proper divisors (99766698682760).
102002536253152 is a wasteful number, since it uses less digits than its factorization.
102002536253152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15107010922 (or 15107010914 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 102002536253152 in words is "one hundred two trillion, two billion, five hundred thirty-six million, two hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •