Base | Representation |
---|---|
bin | 10011001110010111111… |
… | …001001001101001110000 |
3 | 11200021222221221020020111 |
4 | 103032113321021221300 |
5 | 133121104421114412 |
6 | 2450523444351104 |
7 | 164306112531061 |
oct | 23162771115160 |
9 | 4607887836214 |
10 | 1321103301232 |
11 | 46a305410810 |
12 | 1940569a5494 |
13 | 9776c23a530 |
14 | 47d281cc568 |
15 | 2457197a2a7 |
hex | 13397e49a70 |
1321103301232 has 160 divisors (see below), whose sum is σ = 3191619098304. Its totient is φ = 520457011200.
The previous prime is 1321103301227. The next prime is 1321103301233. The reversal of 1321103301232 is 2321033011231.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321103301233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16334878 + ... + 16415554.
Almost surely, 21321103301232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1321103301232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1595809549152).
1321103301232 is an abundant number, since it is smaller than the sum of its proper divisors (1870515797072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321103301232 is a wasteful number, since it uses less digits than its factorization.
1321103301232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81147 (or 81141 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1321103301232 its reverse (2321033011231), we get a palindrome (3642136312463).
The spelling of 1321103301232 in words is "one trillion, three hundred twenty-one billion, one hundred three million, three hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •