Base | Representation |
---|---|
bin | 10111001110100101011011… |
… | …010001111110001011100101 |
3 | 111101201010220212121222112210 |
4 | 113032211123101332023211 |
5 | 101342221202103320112 |
6 | 1001134232345034033 |
7 | 30342423556354134 |
oct | 2716453321761345 |
9 | 441633825558483 |
10 | 102157328573157 |
11 | 2a60675281a640 |
12 | b55a936785919 |
13 | 4500519355b90 |
14 | 1b3262649d91b |
15 | bc252e94ab3c |
hex | 5ce95b47e2e5 |
102157328573157 has 64 divisors (see below), whose sum is σ = 160547110843392. Its totient is φ = 56963875200000.
The previous prime is 102157328573147. The next prime is 102157328573191. The reversal of 102157328573157 is 751375823751201.
It is not a de Polignac number, because 102157328573157 - 24 = 102157328573141 is a prime.
It is a super-2 number, since 2×1021573285731572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102157328573097 and 102157328573106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102157328573107) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 220481782 + ... + 220944632.
It is an arithmetic number, because the mean of its divisors is an integer number (2508548606928).
Almost surely, 2102157328573157 is an apocalyptic number.
It is an amenable number.
102157328573157 is a deficient number, since it is larger than the sum of its proper divisors (58389782270235).
102157328573157 is a wasteful number, since it uses less digits than its factorization.
102157328573157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464562.
The product of its (nonzero) digits is 12348000, while the sum is 57.
The spelling of 102157328573157 in words is "one hundred two trillion, one hundred fifty-seven billion, three hundred twenty-eight million, five hundred seventy-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •