Base | Representation |
---|---|
bin | 10111001101110010000110… |
… | …000001100000010001000010 |
3 | 111101111212122122101022220100 |
4 | 113031302012001200101002 |
5 | 101340320312020224022 |
6 | 1001053035214223230 |
7 | 30335432654523534 |
oct | 2715620601402102 |
9 | 441455578338810 |
10 | 102102211101762 |
11 | 2a595339405593 |
12 | b550113ab4b16 |
13 | 44c8274307591 |
14 | 1b2dab824d854 |
15 | bc0da5b981ac |
hex | 5cdc86060442 |
102102211101762 has 48 divisors (see below), whose sum is σ = 222709588241400. Its totient is φ = 33805134182400.
The previous prime is 102102211101707. The next prime is 102102211101763. The reversal of 102102211101762 is 267101112201201.
It can be written as a sum of positive squares in 4 ways, for example, as 85494784902921 + 16607426198841 = 9246339^2 + 4075221^2 .
It is not an unprimeable number, because it can be changed into a prime (102102211101763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 199717312 + ... + 200227892.
Almost surely, 2102102211101762 is an apocalyptic number.
102102211101762 is an abundant number, since it is smaller than the sum of its proper divisors (120607377139638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102211101762 is a wasteful number, since it uses less digits than its factorization.
102102211101762 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585299 (or 585296 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 27.
Adding to 102102211101762 its reverse (267101112201201), we get a palindrome (369203323302963).
The spelling of 102102211101762 in words is "one hundred two trillion, one hundred two billion, two hundred eleven million, one hundred one thousand, seven hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •