Base | Representation |
---|---|
bin | 10011010011110010100… |
… | …111100000110000000001 |
3 | 11200212000100210000002101 |
4 | 103103302213200300001 |
5 | 133220013103334301 |
6 | 2453325004350401 |
7 | 164603216025535 |
oct | 23236247406001 |
9 | 4625010700071 |
10 | 1326920371201 |
11 | 47181aa58557 |
12 | 1951bab45401 |
13 | 98188447879 |
14 | 4831a9bdbc5 |
15 | 247b24cb701 |
hex | 134f29e0c01 |
1326920371201 has 8 divisors (see below), whose sum is σ = 1372722633000. Its totient is φ = 1281121201920.
The previous prime is 1326920371193. The next prime is 1326920371237. The reversal of 1326920371201 is 1021730296231.
It can be written as a sum of positive squares in 4 ways, for example, as 274367487601 + 1052552883600 = 523801^2 + 1025940^2 .
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 1326920371201 - 23 = 1326920371193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1326920371801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 117225 + ... + 1633273.
It is an arithmetic number, because the mean of its divisors is an integer number (171590329125).
Almost surely, 21326920371201 is an apocalyptic number.
It is an amenable number.
1326920371201 is a deficient number, since it is larger than the sum of its proper divisors (45802261799).
1326920371201 is a wasteful number, since it uses less digits than its factorization.
1326920371201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546259.
The product of its (nonzero) digits is 27216, while the sum is 37.
The spelling of 1326920371201 in words is "one trillion, three hundred twenty-six billion, nine hundred twenty million, three hundred seventy-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •