Base | Representation |
---|---|
bin | 10011000111111111100… |
… | …110101011000110001001 |
3 | 11122122022120112211021012 |
4 | 103013333212223012021 |
5 | 133013042324301403 |
6 | 2443432030253305 |
7 | 163644265116413 |
oct | 23077746530611 |
9 | 4578276484235 |
10 | 1314253353353 |
11 | 46740a834566 |
12 | 192864957235 |
13 | 96c1a051135 |
14 | 478785719b3 |
15 | 242c0400ed8 |
hex | 131ff9ab189 |
1314253353353 has 16 divisors (see below), whose sum is σ = 1366376825856. Its totient is φ = 1262755811520.
The previous prime is 1314253353271. The next prime is 1314253353443. The reversal of 1314253353353 is 3533533524131.
It is a cyclic number.
It is not a de Polignac number, because 1314253353353 - 230 = 1313179611529 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1314253353353.
It is not an unprimeable number, because it can be changed into a prime (1314253253353) 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 15 ways as a sum of consecutive naturals, for example, 4267175 + ... + 4564787.
It is an arithmetic number, because the mean of its divisors is an integer number (85398551616).
Almost surely, 21314253353353 is an apocalyptic number.
It is an amenable number.
1314253353353 is a deficient number, since it is larger than the sum of its proper divisors (52123472503).
1314253353353 is a wasteful number, since it uses less digits than its factorization.
1314253353353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298664.
The product of its digits is 729000, while the sum is 41.
Adding to 1314253353353 its reverse (3533533524131), we get a palindrome (4847786877484).
The spelling of 1314253353353 in words is "one trillion, three hundred fourteen billion, two hundred fifty-three million, three hundred fifty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •