Base | Representation |
---|---|
bin | 10010111111101011010… |
… | …100000111100000000100 |
3 | 11121210021012112101021121 |
4 | 102333223110013200010 |
5 | 132341300142310202 |
6 | 2435353534123324 |
7 | 163210056342205 |
oct | 22775324074004 |
9 | 4553235471247 |
10 | 1305323010052 |
11 | 46364789a456 |
12 | 190b92050544 |
13 | 96125b4c329 |
14 | 4726c4cd5ac |
15 | 23e4b3d3537 |
hex | 12feb507804 |
1305323010052 has 24 divisors (see below), whose sum is σ = 2316018663000. Its totient is φ = 643606569216.
The previous prime is 1305323010011. The next prime is 1305323010059. The reversal of 1305323010052 is 2500103235031.
It can be written as a sum of positive squares in 4 ways, for example, as 188107833796 + 1117215176256 = 433714^2 + 1056984^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1305323009999 and 1305323010026.
It is not an unprimeable number, because it can be changed into a prime (1305323010059) 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 7 ways as a sum of consecutive naturals, for example, 1261074 + ... + 2049622.
It is an arithmetic number, because the mean of its divisors is an integer number (96500777625).
Almost surely, 21305323010052 is an apocalyptic number.
It is an amenable number.
1305323010052 is a deficient number, since it is larger than the sum of its proper divisors (1010695652948).
1305323010052 is a wasteful number, since it uses less digits than its factorization.
1305323010052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 794295 (or 794293 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 1305323010052 its reverse (2500103235031), we get a palindrome (3805426245083).
The spelling of 1305323010052 in words is "one trillion, three hundred five billion, three hundred twenty-three million, ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •