Base | Representation |
---|---|
bin | 10010111000001110000… |
… | …110111111101001110000 |
3 | 11121000121020111200220210 |
4 | 102320032012333221300 |
5 | 132223401102304000 |
6 | 2431551254104120 |
7 | 162504502114551 |
oct | 22701606775160 |
9 | 4530536450823 |
10 | 1297316838000 |
11 | 460209596937 |
12 | 18b51894b040 |
13 | 9544b257b11 |
14 | 46b0d09a328 |
15 | 23b2d5b9350 |
hex | 12e0e1bfa70 |
1297316838000 has 160 divisors (see below), whose sum is σ = 4187158290432. Its totient is φ = 345569952000.
The previous prime is 1297316837959. The next prime is 1297316838007. The reversal of 1297316838000 is 8386137921.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1297316838007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5347329 + ... + 5584671.
Almost surely, 21297316838000 is an apocalyptic number.
1297316838000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1297316838000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2093579145216).
1297316838000 is an abundant number, since it is smaller than the sum of its proper divisors (2889841452432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1297316838000 is a wasteful number, since it uses less digits than its factorization.
1297316838000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238280 (or 238264 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 48.
The spelling of 1297316838000 in words is "one trillion, two hundred ninety-seven billion, three hundred sixteen million, eight hundred thirty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •