Base | Representation |
---|---|
bin | 100110100110011… |
… | …1001100100000100 |
3 | 10100021012100121120 |
4 | 1031030321210010 |
5 | 10123034232030 |
6 | 332305113540 |
7 | 44045151264 |
oct | 11514714404 |
9 | 3307170546 |
10 | 1295227140 |
11 | 605138359 |
12 | 3019288b0 |
13 | 1784566bc |
14 | c403b7a4 |
15 | 78a9b010 |
hex | 4d339904 |
1295227140 has 48 divisors (see below), whose sum is σ = 3629126592. Its totient is φ = 345156736.
The previous prime is 1295227139. The next prime is 1295227147. The reversal of 1295227140 is 417225921.
It is a super-2 number, since 2×12952271402 = 3355226688385159200, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1295227147) by changing a digit.
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, 91627 + ... + 104813.
It is an arithmetic number, because the mean of its divisors is an integer number (75606804).
Almost surely, 21295227140 is an apocalyptic number.
1295227140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1295227140 is an abundant number, since it is smaller than the sum of its proper divisors (2333899452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1295227140 is a wasteful number, since it uses less digits than its factorization.
1295227140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14836 (or 14834 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 1295227140 is about 35989.2642325458. The cubic root of 1295227140 is about 1090.0555873231.
The spelling of 1295227140 in words is "one billion, two hundred ninety-five million, two hundred twenty-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •