Base | Representation |
---|---|
bin | 10111010000101100011100… |
… | …011000000110011001011100 |
3 | 111102020000010022220100210212 |
4 | 113100230130120012121130 |
5 | 101402110103314300012 |
6 | 1001325010114551552 |
7 | 30356045262133625 |
oct | 2720543430063134 |
9 | 442200108810725 |
10 | 102302302103132 |
11 | 2a66218758142a |
12 | b582a55b985b8 |
13 | 45110b1439401 |
14 | 1b3965a45ca4c |
15 | bc61b70e5b22 |
hex | 5d0b1c60665c |
102302302103132 has 24 divisors (see below), whose sum is σ = 183224674769136. Its totient is φ = 49952812952448.
The previous prime is 102302302103117. The next prime is 102302302103137. The reversal of 102302302103132 is 231301203203201.
It is a super-2 number, since 2×1023023021031322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102302302103098 and 102302302103107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102302302103137) 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, 51258713 + ... + 53217104.
It is an arithmetic number, because the mean of its divisors is an integer number (7634361448714).
Almost surely, 2102302302103132 is an apocalyptic number.
It is an amenable number.
102302302103132 is a deficient number, since it is larger than the sum of its proper divisors (80922372666004).
102302302103132 is a wasteful number, since it uses less digits than its factorization.
102302302103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104481557 (or 104481555 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102302302103132 its reverse (231301203203201), we get a palindrome (333603505306333).
The spelling of 102302302103132 in words is "one hundred two trillion, three hundred two billion, three hundred two million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •