Base | Representation |
---|---|
bin | 10111010001001000001110… |
… | …111011010110010010101010 |
3 | 111102022212010212111020021212 |
4 | 113101020032323112102222 |
5 | 101403102211123431242 |
6 | 1001350423043033122 |
7 | 30361152566431400 |
oct | 2721101673262252 |
9 | 442285125436255 |
10 | 102332141233322 |
11 | 2a6738a9a29600 |
12 | b5887a306b7a2 |
13 | 4513b58397b70 |
14 | 1b3ac8b38d470 |
15 | bc6d61a44782 |
hex | 5d120eed64aa |
102332141233322 has 72 divisors (see below), whose sum is σ = 211364988790788. Its totient is φ = 36802768020480.
The previous prime is 102332141233321. The next prime is 102332141233397. The reversal of 102332141233322 is 223332141233201.
It can be written as a sum of positive squares in 2 ways, for example, as 102203223612721 + 128917620601 = 10109561^2 + 359051^2 .
It is not an unprimeable number, because it can be changed into a prime (102332141233321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 331761143 + ... + 332069450.
Almost surely, 2102332141233322 is an apocalyptic number.
102332141233322 is an abundant number, since it is smaller than the sum of its proper divisors (109032847557466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102332141233322 is a wasteful number, since it uses less digits than its factorization.
102332141233322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663830644 (or 663830626 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 102332141233322 its reverse (223332141233201), we get a palindrome (325664282466523).
The spelling of 102332141233322 in words is "one hundred two trillion, three hundred thirty-two billion, one hundred forty-one million, two hundred thirty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •