Base | Representation |
---|---|
bin | 10011001111100001000… |
… | …001011111000110011000 |
3 | 11200102011110121022111110 |
4 | 103033201001133012120 |
5 | 133131113014114000 |
6 | 2451245313500320 |
7 | 164351401304343 |
oct | 23174101370630 |
9 | 4612143538443 |
10 | 1322330223000 |
11 | 46a884a35246 |
12 | 1943398716a0 |
13 | 97906499847 |
14 | 4800312945a |
15 | 245e4532850 |
hex | 133e105f198 |
1322330223000 has 128 divisors (see below), whose sum is σ = 4158157086720. Its totient is φ = 349844745600.
The previous prime is 1322330222963. The next prime is 1322330223001. The reversal of 1322330223000 is 3220332231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322330223001) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1354342 + ... + 2116341.
It is an arithmetic number, because the mean of its divisors is an integer number (32485602240).
Almost surely, 21322330223000 is an apocalyptic number.
1322330223000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1322330223000 is an abundant number, since it is smaller than the sum of its proper divisors (2835826863720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1322330223000 is a wasteful number, since it uses less digits than its factorization.
1322330223000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3470834 (or 3470820 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 1322330223000 its reverse (3220332231), we get a palindrome (1325550555231).
The spelling of 1322330223000 in words is "one trillion, three hundred twenty-two billion, three hundred thirty million, two hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •