Base | Representation |
---|---|
bin | 10010110111101111011… |
… | …010010000000000000000 |
3 | 11120222021100100122122000 |
4 | 102313233122100000000 |
5 | 132221322224321000 |
6 | 2431424214544000 |
7 | 162455646233661 |
oct | 22675732200000 |
9 | 4528240318560 |
10 | 1296801792000 |
11 | 45aa74893190 |
12 | 18b3b4368000 |
13 | 95398635480 |
14 | 46aa0909368 |
15 | 23aed27d000 |
hex | 12def690000 |
1296801792000 has 2176 divisors, whose sum is σ = 5770982730240. Its totient is φ = 283115520000.
The previous prime is 1296801791977. The next prime is 1296801792037. The reversal of 1296801792000 is 2971086921.
It is a super-2 number, since 2×12968017920002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 31629311980 + ... + 31629312020.
Almost surely, 21296801792000 is an apocalyptic number.
1296801792000 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 1296801792000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2885491365120).
1296801792000 is an abundant number, since it is smaller than the sum of its proper divisors (4474180938240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1296801792000 is an equidigital number, since it uses as much as digits as its factorization.
1296801792000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121 (or 75 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 45.
The spelling of 1296801792000 in words is "one trillion, two hundred ninety-six billion, eight hundred one million, seven hundred ninety-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •