Base | Representation |
---|---|
bin | 1011001101001111000100… |
… | …0110001000011010010100 |
3 | 1121121222021010210221120101 |
4 | 2303103301012020122110 |
5 | 3103340434321340200 |
6 | 42112353113543444 |
7 | 2411143631253226 |
oct | 263236106103224 |
9 | 47558233727511 |
10 | 12322011121300 |
11 | 3a20810053341 |
12 | 1470108714b84 |
13 | 6b4c6476550a |
14 | 308562158416 |
15 | 1657ccba826a |
hex | b34f1188694 |
12322011121300 has 36 divisors (see below), whose sum is σ = 26739020828380. Its totient is φ = 4928757131520.
The previous prime is 12322011121279. The next prime is 12322011121331. The reversal of 12322011121300 is 312111022321.
It can be written as a sum of positive squares in 6 ways, for example, as 689354915076 + 11632656206224 = 830274^2 + 3410668^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11009152 + ... + 12076648.
Almost surely, 212322011121300 is an apocalyptic number.
12322011121300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12322011121300 is an abundant number, since it is smaller than the sum of its proper divisors (14417009707080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12322011121300 is a wasteful number, since it uses less digits than its factorization.
12322011121300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182940 (or 1182933 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12322011121300 its reverse (312111022321), we get a palindrome (12634122143621).
The spelling of 12322011121300 in words is "twelve trillion, three hundred twenty-two billion, eleven million, one hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •