Base | Representation |
---|---|
bin | 10111001111110011101001… |
… | …110000110100101101111011 |
3 | 111102000011201121201111110101 |
4 | 113033303221300310231323 |
5 | 101400110212242413110 |
6 | 1001241003205500231 |
7 | 30351456206553265 |
oct | 2717635160645573 |
9 | 442004647644411 |
10 | 102241323404155 |
11 | 2a6393356aa341 |
12 | b573078411677 |
13 | 4508413cbc700 |
14 | 1b36713a04b35 |
15 | bc47e89bd13a |
hex | 5cfce9c34b7b |
102241323404155 has 24 divisors (see below), whose sum is σ = 132858325376928. Its totient is φ = 75498385038336.
The previous prime is 102241323404147. The next prime is 102241323404161. The reversal of 102241323404155 is 551404323142201.
It is not a de Polignac number, because 102241323404155 - 23 = 102241323404147 is a prime.
It is a super-2 number, since 2×1022413234041552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19814059 + ... + 24435211.
It is an arithmetic number, because the mean of its divisors is an integer number (5535763557372).
Almost surely, 2102241323404155 is an apocalyptic number.
102241323404155 is a deficient number, since it is larger than the sum of its proper divisors (30617001972773).
102241323404155 is a wasteful number, since it uses less digits than its factorization.
102241323404155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4647367 (or 4647354 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 102241323404155 its reverse (551404323142201), we get a palindrome (653645646546356).
The spelling of 102241323404155 in words is "one hundred two trillion, two hundred forty-one billion, three hundred twenty-three million, four hundred four thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •