Base | Representation |
---|---|
bin | 10010110111010001010… |
… | …001111011111101101000 |
3 | 11120220222010011210212220 |
4 | 102313101101323331220 |
5 | 132214303322440141 |
6 | 2431302120234040 |
7 | 162440300500401 |
oct | 22672121737550 |
9 | 4526863153786 |
10 | 1296296296296 |
11 | 45a835512841 |
12 | 18b29300b920 |
13 | 953179a7aa1 |
14 | 46a537229a8 |
15 | 23abdbcb766 |
hex | 12dd147bf68 |
1296296296296 has 32 divisors (see below), whose sum is σ = 3243018226560. Its totient is φ = 431795100672.
The previous prime is 1296296296279. The next prime is 1296296296297. The reversal of 1296296296296 is 6926926926921.
1296296296296 is a modest number, since divided by 296296296 gives 1296 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 1296296296296.
It is not an unprimeable number, because it can be changed into a prime (1296296296297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18944185 + ... + 19012488.
It is an arithmetic number, because the mean of its divisors is an integer number (101344319580).
Almost surely, 21296296296296 is an apocalyptic number.
It is an amenable number.
1296296296296 is an abundant number, since it is smaller than the sum of its proper divisors (1946721930264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1296296296296 is a wasteful number, since it uses less digits than its factorization.
1296296296296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37958105 (or 37958101 counting only the distinct ones).
The product of its digits is 136048896, while the sum is 69.
The spelling of 1296296296296 in words is "one trillion, two hundred ninety-six billion, two hundred ninety-six million, two hundred ninety-six thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •