Base | Representation |
---|---|
bin | 1011000111010011111010… |
… | …1010010010011111011100 |
3 | 1121021020120001202101100212 |
4 | 2301310332222102133130 |
5 | 3100204014201332200 |
6 | 41553521520311552 |
7 | 2400611525412104 |
oct | 261647652223734 |
9 | 47236501671325 |
10 | 12220233230300 |
11 | 3991632094437 |
12 | 14544434725b8 |
13 | 6a8494807084 |
14 | 303668d38204 |
15 | 162d22831035 |
hex | b1d3ea927dc |
12220233230300 has 144 divisors (see below), whose sum is σ = 27293959741440. Its totient is φ = 4747432032000.
The previous prime is 12220233230291. The next prime is 12220233230329. The reversal of 12220233230300 is 303233202221.
It is a congruent number.
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, 163424321 + ... + 163499079.
Almost surely, 212220233230300 is an apocalyptic number.
12220233230300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12220233230300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13646979870720).
12220233230300 is an abundant number, since it is smaller than the sum of its proper divisors (15073726511140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12220233230300 is a wasteful number, since it uses less digits than its factorization.
12220233230300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75172 (or 75165 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 12220233230300 its reverse (303233202221), we get a palindrome (12523466432521).
The spelling of 12220233230300 in words is "twelve trillion, two hundred twenty billion, two hundred thirty-three million, two hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •