Base | Representation |
---|---|
bin | 10011010000010110000… |
… | …011111000100111001000 |
3 | 11200111110110221220202101 |
4 | 103100112003320213020 |
5 | 133134423312403412 |
6 | 2451513501443144 |
7 | 164412424540342 |
oct | 23202603704710 |
9 | 4614413856671 |
10 | 1323220044232 |
11 | 4701a1245099 |
12 | 1945478704b4 |
13 | 97a1893b198 |
14 | 48089396292 |
15 | 246476ed457 |
hex | 134160f89c8 |
1323220044232 has 16 divisors (see below), whose sum is σ = 2481059669760. Its totient is φ = 661604132304.
The previous prime is 1323220044203. The next prime is 1323220044239. The reversal of 1323220044232 is 2324400223231.
It is a super-2 number, since 2×13232200442322 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1323220044232.
It is not an unprimeable number, because it can be changed into a prime (1323220044239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 305253 + ... + 1655179.
It is an arithmetic number, because the mean of its divisors is an integer number (155066229360).
Almost surely, 21323220044232 is an apocalyptic number.
It is an amenable number.
1323220044232 is a deficient number, since it is larger than the sum of its proper divisors (1157839625528).
1323220044232 is a wasteful number, since it uses less digits than its factorization.
1323220044232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472460 (or 1472456 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 1323220044232 its reverse (2324400223231), we get a palindrome (3647620267463).
The spelling of 1323220044232 in words is "one trillion, three hundred twenty-three billion, two hundred twenty million, forty-four thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •