Base | Representation |
---|---|
bin | 100101000000010… |
… | …1010111001100000 |
3 | 10012112110101001021 |
4 | 1022000222321200 |
5 | 10020333032241 |
6 | 323113415224 |
7 | 42525121402 |
oct | 11200527140 |
9 | 3175411037 |
10 | 1241689696 |
11 | 5879a0935 |
12 | 2a7a0a514 |
13 | 16a330140 |
14 | baca2b72 |
15 | 740230d1 |
hex | 4a02ae60 |
1241689696 has 24 divisors (see below), whose sum is σ = 2632621824. Its totient is φ = 573087360.
The previous prime is 1241689693. The next prime is 1241689703. The reversal of 1241689696 is 6969861421.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1241689693) 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 3 ways as a sum of consecutive naturals, for example, 1492000 + ... + 1492831.
It is an arithmetic number, because the mean of its divisors is an integer number (109692576).
Almost surely, 21241689696 is an apocalyptic number.
1241689696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1241689696 is an abundant number, since it is smaller than the sum of its proper divisors (1390932128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1241689696 is a wasteful number, since it uses less digits than its factorization.
1241689696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2984854 (or 2984846 counting only the distinct ones).
The product of its digits is 1119744, while the sum is 52.
The square root of 1241689696 is about 35237.6176266217. The cubic root of 1241689696 is about 1074.8248341958.
The spelling of 1241689696 in words is "one billion, two hundred forty-one million, six hundred eighty-nine thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •