Base | Representation |
---|---|
bin | 100110011111001… |
… | …0010010000000000 |
3 | 10022222222201102001 |
4 | 1030332102100000 |
5 | 10121044133341 |
6 | 332051033344 |
7 | 44000454124 |
oct | 11476222000 |
9 | 3288881361 |
10 | 1291396096 |
11 | 602a61001 |
12 | 30059b854 |
13 | 177714a03 |
14 | c3721584 |
15 | 78590d31 |
hex | 4cf92400 |
1291396096 has 33 divisors (see below), whose sum is σ = 2583831891. Its totient is φ = 645123072.
The previous prime is 1291396069. The next prime is 1291396097. The reversal of 1291396096 is 6906931921.
The square root of 1291396096 is 35936.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1291396097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1149391 + ... + 1150513.
Almost surely, 21291396096 is an apocalyptic number.
1291396096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1291396096 is the 35936-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1291396096
1291396096 is an abundant number, since it is smaller than the sum of its proper divisors (1292435795).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1291396096 is an frugal number, since it uses more digits than its factorization.
1291396096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2266 (or 1125 counting only the distinct ones).
The product of its (nonzero) digits is 157464, while the sum is 46.
The cubic root of 1291396096 is about 1088.9797978861.
The spelling of 1291396096 in words is "one billion, two hundred ninety-one million, three hundred ninety-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •