Base | Representation |
---|---|
bin | 10111001110001110110111… |
… | …111011101110111111101100 |
3 | 111101121211102021011122100210 |
4 | 113032032313323232333230 |
5 | 101341322103441033400 |
6 | 1001115145434022420 |
7 | 30340605520306113 |
oct | 2716166773567754 |
9 | 441554367148323 |
10 | 102133113221100 |
11 | 2a5a7456899195 |
12 | b5560b8b77a10 |
13 | 44cb15a5588b0 |
14 | 1b313aa406c7a |
15 | bc1ab3abb950 |
hex | 5ce3b7eeefec |
102133113221100 has 144 divisors (see below), whose sum is σ = 321811995526560. Its totient is φ = 24857981491200.
The previous prime is 102133113220987. The next prime is 102133113221101. The reversal of 102133113221100 is 1122311331201.
It is not an unprimeable number, because it can be changed into a prime (102133113221101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 146776371 + ... + 147470570.
It is an arithmetic number, because the mean of its divisors is an integer number (2234805524490).
Almost surely, 2102133113221100 is an apocalyptic number.
102133113221100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102133113221100 is an abundant number, since it is smaller than the sum of its proper divisors (219678882305460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102133113221100 is a wasteful number, since it uses less digits than its factorization.
102133113221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294247060 (or 294247053 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 102133113221100 its reverse (1122311331201), we get a palindrome (103255424552301).
The spelling of 102133113221100 in words is "one hundred two trillion, one hundred thirty-three billion, one hundred thirteen million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •