Base | Representation |
---|---|
bin | 10111001110001110111101… |
… | …010011000011110111110000 |
3 | 111101121211122112112011101110 |
4 | 113032032331103003313300 |
5 | 101341322300011101000 |
6 | 1001115202411033320 |
7 | 30340610662304316 |
oct | 2716167523036760 |
9 | 441554575464343 |
10 | 102133203222000 |
11 | 2a5a74a26801a5 |
12 | b55612313b840 |
13 | 44cb1730ab072 |
14 | 1b313b83540b6 |
15 | bc1abb948850 |
hex | 5ce3bd4c3df0 |
102133203222000 has 80 divisors (see below), whose sum is σ = 329277447207072. Its totient is φ = 27235520857600.
The previous prime is 102133203221989. The next prime is 102133203222007. The reversal of 102133203222000 is 222302331201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102133203222007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8511094269 + ... + 8511106268.
Almost surely, 2102133203222000 is an apocalyptic number.
102133203222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102133203222000 is an abundant number, since it is smaller than the sum of its proper divisors (227144243985072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102133203222000 is a wasteful number, since it uses less digits than its factorization.
102133203222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17022200563 (or 17022200547 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 102133203222000 its reverse (222302331201), we get a palindrome (102355505553201).
The spelling of 102133203222000 in words is "one hundred two trillion, one hundred thirty-three billion, two hundred three million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •