Base | Representation |
---|---|
bin | 100101100001110011010001… |
… | …0000010110000111000111000 |
3 | 1121021210100102122210020201220 |
4 | 1023003212202002300320320 |
5 | 321231333342121232300 |
6 | 3130022152022512040 |
7 | 126350004001651554 |
oct | 11303464202607070 |
9 | 1537710378706656 |
10 | 330101020102200 |
11 | 961a906914a546 |
12 | 31033957895620 |
13 | 112265147ab769 |
14 | 5b72d90504864 |
15 | 2826a421c4da0 |
hex | 12c39a20b0e38 |
330101020102200 has 96 divisors (see below), whose sum is σ = 1023316089434160. Its totient is φ = 88026686899200.
The previous prime is 330101020102193. The next prime is 330101020102213. The reversal of 330101020102200 is 2201020101033.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 330101020102200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 314007852 + ... + 315057348.
Almost surely, 2330101020102200 is an apocalyptic number.
330101020102200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
330101020102200 is an abundant number, since it is smaller than the sum of its proper divisors (693215069331960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330101020102200 is a wasteful number, since it uses less digits than its factorization.
330101020102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1573737 (or 1573728 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 330101020102200 its reverse (2201020101033), we get a palindrome (332302040203233).
The spelling of 330101020102200 in words is "three hundred thirty trillion, one hundred one billion, twenty million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •