Base | Representation |
---|---|
bin | 10111001110001110110001… |
… | …110010011100010111101100 |
3 | 111101121211011002011200021202 |
4 | 113032032301302130113230 |
5 | 101341321401042402340 |
6 | 1001115131312145032 |
7 | 30340603126056230 |
oct | 2716166162342754 |
9 | 441554132150252 |
10 | 102133010122220 |
11 | 2a5a7403680500 |
12 | b55608a538178 |
13 | 44cb14209b73c |
14 | 1b3139a84a5c0 |
15 | bc1aa9a03c15 |
hex | 5ce3b1c9c5ec |
102133010122220 has 144 divisors (see below), whose sum is σ = 283609020737280. Its totient is φ = 30158209319040.
The previous prime is 102133010122189. The next prime is 102133010122237. The reversal of 102133010122220 is 22221010331201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 102133010122192 and 102133010122201.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 158338754 + ... + 158982473.
Almost surely, 2102133010122220 is an apocalyptic number.
102133010122220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102133010122220 is an abundant number, since it is smaller than the sum of its proper divisors (181476010615060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102133010122220 is a wasteful number, since it uses less digits than its factorization.
102133010122220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317321284 (or 317321271 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102133010122220 its reverse (22221010331201), we get a palindrome (124354020453421).
The spelling of 102133010122220 in words is "one hundred two trillion, one hundred thirty-three billion, ten million, one hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •