Base | Representation |
---|---|
bin | 10011000110001101000… |
… | …110000100010011000001 |
3 | 11122110100200120021200212 |
4 | 103012031012010103001 |
5 | 133000124021000301 |
6 | 2442513241323505 |
7 | 163545546450515 |
oct | 23061506042301 |
9 | 4573320507625 |
10 | 1312332203201 |
11 | 466614352a68 |
12 | 192409496595 |
13 | 969a20237b6 |
14 | 47735360145 |
15 | 2420b9164bb |
hex | 1318d1844c1 |
1312332203201 has 8 divisors (see below), whose sum is σ = 1389912871464. Its totient is φ = 1234794274560.
The previous prime is 1312332203137. The next prime is 1312332203243. The reversal of 1312332203201 is 1023022332131.
It can be written as a sum of positive squares in 4 ways, for example, as 6228366400 + 1306103836801 = 78920^2 + 1142849^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 1312332203201 - 26 = 1312332203137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312332203291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10621670 + ... + 10744511.
It is an arithmetic number, because the mean of its divisors is an integer number (173739108933).
Almost surely, 21312332203201 is an apocalyptic number.
It is an amenable number.
1312332203201 is a deficient number, since it is larger than the sum of its proper divisors (77580668263).
1312332203201 is a wasteful number, since it uses less digits than its factorization.
1312332203201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21369811.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1312332203201 its reverse (1023022332131), we get a palindrome (2335354535332).
The spelling of 1312332203201 in words is "one trillion, three hundred twelve billion, three hundred thirty-two million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •