Base | Representation |
---|---|
bin | 100110100110001… |
… | …0001110001101000 |
3 | 10100020220002001120 |
4 | 1031030101301220 |
5 | 10123014023133 |
6 | 332301415240 |
7 | 44043602166 |
oct | 11514216150 |
9 | 3306802046 |
10 | 1295064168 |
11 | 605036972 |
12 | 30186a520 |
13 | 1783ca478 |
14 | c3dd8236 |
15 | 78a67ab3 |
hex | 4d311c68 |
1295064168 has 64 divisors (see below), whose sum is σ = 3412800000. Its totient is φ = 408399552.
The previous prime is 1295064083. The next prime is 1295064193. The reversal of 1295064168 is 8614605921.
It is a Cunningham number, because it is equal to 359872-1.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 430333 + ... + 433331.
It is an arithmetic number, because the mean of its divisors is an integer number (53325000).
Almost surely, 21295064168 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1295064168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1706400000).
1295064168 is an abundant number, since it is smaller than the sum of its proper divisors (2117735832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1295064168 is a wasteful number, since it uses less digits than its factorization.
1295064168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3974 (or 3970 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 42.
The square root of 1295064168 is about 35986.9999861061. Note that the first 4 decimals coincide. The cubic root of 1295064168 is about 1090.0098666447.
The spelling of 1295064168 in words is "one billion, two hundred ninety-five million, sixty-four thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •