Base | Representation |
---|---|
bin | 10011001101011111010… |
… | …000001101010110000001 |
3 | 11200012112201212011212021 |
4 | 103031133100031112001 |
5 | 133112133134404403 |
6 | 2450245301201441 |
7 | 164243423504623 |
oct | 23153720152601 |
9 | 4605481764767 |
10 | 1320153044353 |
11 | 469967a82750 |
12 | 193a30700281 |
13 | 9764a3c8860 |
14 | 47c77d0cc13 |
15 | 245183228bd |
hex | 1335f40d581 |
1320153044353 has 16 divisors (see below), whose sum is σ = 1551132902592. Its totient is φ = 1107689400000.
The previous prime is 1320153044351. The next prime is 1320153044383. The reversal of 1320153044353 is 3534403510231.
It is a cyclic number.
It is not a de Polignac number, because 1320153044353 - 21 = 1320153044351 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1320153044351) 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 15 ways as a sum of consecutive naturals, for example, 672658 + ... + 1758628.
It is an arithmetic number, because the mean of its divisors is an integer number (96945806412).
Almost surely, 21320153044353 is an apocalyptic number.
1320153044353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1320153044353 is a deficient number, since it is larger than the sum of its proper divisors (230979858239).
1320153044353 is a wasteful number, since it uses less digits than its factorization.
1320153044353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094496.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 1320153044353 its reverse (3534403510231), we get a palindrome (4854556554584).
The spelling of 1320153044353 in words is "one trillion, three hundred twenty billion, one hundred fifty-three million, forty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •