Base | Representation |
---|---|
bin | 10111000010100011000111… |
… | …111101110111101101101000 |
3 | 111021210002000111012100001221 |
4 | 113002203013331313231220 |
5 | 101240143244133112300 |
6 | 555302243441151424 |
7 | 30225603252665032 |
oct | 2702430775675550 |
9 | 437702014170057 |
10 | 101330223332200 |
11 | 2a3179a7441165 |
12 | b44658692b574 |
13 | 447052596b7b5 |
14 | 1b045a233cc52 |
15 | baac71c3631a |
hex | 5c28c7f77b68 |
101330223332200 has 48 divisors (see below), whose sum is σ = 235663882399980. Its totient is φ = 40519854812160.
The previous prime is 101330223332189. The next prime is 101330223332267. The reversal of 101330223332200 is 2233322033101.
It can be written as a sum of positive squares in 6 ways, for example, as 49950658786084 + 51379564546116 = 7067578^2 + 7167954^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75801499 + ... + 77126698.
Almost surely, 2101330223332200 is an apocalyptic number.
101330223332200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101330223332200 is an abundant number, since it is smaller than the sum of its proper divisors (134333659067780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101330223332200 is a wasteful number, since it uses less digits than its factorization.
101330223332200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152931526 (or 152931517 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 101330223332200 its reverse (2233322033101), we get a palindrome (103563545365301).
The spelling of 101330223332200 in words is "one hundred one trillion, three hundred thirty billion, two hundred twenty-three million, three hundred thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •