Base | Representation |
---|---|
bin | 100111011000100… |
… | …1011000101101011 |
3 | 10102002122211110220 |
4 | 1032301023011223 |
5 | 10201301411243 |
6 | 335044341123 |
7 | 44514451344 |
oct | 11661130553 |
9 | 3362584426 |
10 | 1321513323 |
11 | 618a61579 |
12 | 30a6a47a3 |
13 | 180a2b160 |
14 | c77210cb |
15 | 7b03e783 |
hex | 4ec4b16b |
1321513323 has 32 divisors (see below), whose sum is σ = 1988872704. Its totient is φ = 774419712.
The previous prime is 1321513261. The next prime is 1321513339. The reversal of 1321513323 is 3233151231.
1321513323 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1321513323 - 213 = 1321505131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1321513293 and 1321513302.
It is not an unprimeable number, because it can be changed into a prime (1321513363) 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, 205840 + ... + 212162.
It is an arithmetic number, because the mean of its divisors is an integer number (62152272).
Almost surely, 21321513323 is an apocalyptic number.
1321513323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1321513323 is a deficient number, since it is larger than the sum of its proper divisors (667359381).
1321513323 is a wasteful number, since it uses less digits than its factorization.
1321513323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6595.
The product of its digits is 1620, while the sum is 24.
The square root of 1321513323 is about 36352.6247057898. The cubic root of 1321513323 is about 1097.3803566458.
Adding to 1321513323 its reverse (3233151231), we get a palindrome (4554664554).
The spelling of 1321513323 in words is "one billion, three hundred twenty-one million, five hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •