Base | Representation |
---|---|
bin | 10111001111010111011011… |
… | …100011000001011011110100 |
3 | 111101220021111201202212211012 |
4 | 113033113123203001123310 |
5 | 101344111132123243012 |
6 | 1001215032221331352 |
7 | 30346334235165260 |
oct | 2717273343013364 |
9 | 441807451685735 |
10 | 102211020134132 |
11 | 2a6274a5259028 |
12 | b56921ba06b58 |
13 | 45055c4b532c0 |
14 | 1b3507b1b50a0 |
15 | bc3b2343b622 |
hex | 5cf5db8c16f4 |
102211020134132 has 48 divisors (see below), whose sum is σ = 221419337661312. Its totient is φ = 40201399751040.
The previous prime is 102211020134129. The next prime is 102211020134147. The reversal of 102211020134132 is 231431020112201.
It is a junction number, because it is equal to n+sod(n) for n = 102211020134098 and 102211020134107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 811496294 + ... + 811622237.
It is an arithmetic number, because the mean of its divisors is an integer number (4612902867944).
Almost surely, 2102211020134132 is an apocalyptic number.
It is an amenable number.
102211020134132 is an abundant number, since it is smaller than the sum of its proper divisors (119208317527180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211020134132 is a wasteful number, since it uses less digits than its factorization.
102211020134132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1623118728 (or 1623118726 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 102211020134132 its reverse (231431020112201), we get a palindrome (333642040246333).
The spelling of 102211020134132 in words is "one hundred two trillion, two hundred eleven billion, twenty million, one hundred thirty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •