Base | Representation |
---|---|
bin | 10111001111101011011000… |
… | …011001100010000010001010 |
3 | 111101222022210200002002120012 |
4 | 113033223120121202002022 |
5 | 101344434020142313200 |
6 | 1001232534025431522 |
7 | 30351023135264141 |
oct | 2717533031420212 |
9 | 441868720062505 |
10 | 102232442151050 |
11 | 2a635598444442 |
12 | b5713ba03b5a2 |
13 | 450762a017b63 |
14 | 1b361102a0758 |
15 | bc4478e4aa35 |
hex | 5cfad866208a |
102232442151050 has 96 divisors (see below), whose sum is σ = 200045586263040. Its totient is φ = 38816342323200.
The previous prime is 102232442151041. The next prime is 102232442151061. The reversal of 102232442151050 is 50151244232201.
It is a super-2 number, since 2×1022324421510502 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102232442150998 and 102232442151016.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 297457706 + ... + 297801194.
It is an arithmetic number, because the mean of its divisors is an integer number (2083808190240).
Almost surely, 2102232442151050 is an apocalyptic number.
102232442151050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102232442151050 is a deficient number, since it is larger than the sum of its proper divisors (97813144111990).
102232442151050 is a wasteful number, since it uses less digits than its factorization.
102232442151050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347208 (or 347203 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 102232442151050 its reverse (50151244232201), we get a palindrome (152383686383251).
The spelling of 102232442151050 in words is "one hundred two trillion, two hundred thirty-two billion, four hundred forty-two million, one hundred fifty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •