Base | Representation |
---|---|
bin | 10011010001001010100… |
… | …010111111111111000101 |
3 | 11200120201211220121022111 |
4 | 103101022202333333011 |
5 | 133143224224204013 |
6 | 2452141115301021 |
7 | 164443306351351 |
oct | 23211242777705 |
9 | 4616654817274 |
10 | 1324100616133 |
11 | 470603307869 |
12 | 19475274a771 |
13 | 97b291c1849 |
14 | 481302d6461 |
15 | 24699b8d73d |
hex | 1344a8bffc5 |
1324100616133 has 8 divisors (see below), whose sum is σ = 1324767024000. Its totient is φ = 1323434383968.
The previous prime is 1324100616127. The next prime is 1324100616187. The reversal of 1324100616133 is 3316160014231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1324100616133 - 213 = 1324100607941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1324100616095 and 1324100616104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1324100611133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16573918 + ... + 16653616.
It is an arithmetic number, because the mean of its divisors is an integer number (165595878000).
Almost surely, 21324100616133 is an apocalyptic number.
It is an amenable number.
1324100616133 is a deficient number, since it is larger than the sum of its proper divisors (666407867).
1324100616133 is an equidigital number, since it uses as much as digits as its factorization.
1324100616133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87851.
The product of its (nonzero) digits is 7776, while the sum is 31.
The spelling of 1324100616133 in words is "one trillion, three hundred twenty-four billion, one hundred million, six hundred sixteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •