Base | Representation |
---|---|
bin | 100111000111001… |
… | …1001011101010000 |
3 | 10101110111200102100 |
4 | 1032032121131100 |
5 | 10141433202021 |
6 | 334121120400 |
7 | 44344122501 |
oct | 11616313520 |
9 | 3343450370 |
10 | 1312397136 |
11 | 6138a5436 |
12 | 307629100 |
13 | 17bb8896b |
14 | c642aba8 |
15 | 7a33d626 |
hex | 4e399750 |
1312397136 has 30 divisors (see below), whose sum is σ = 3672889610. Its totient is φ = 437465664.
The previous prime is 1312397129. The next prime is 1312397159. The reversal of 1312397136 is 6317932131.
1312397136 is a `hidden beast` number, since 131 + 2 + 397 + 136 = 666.
It can be written as a sum of positive squares in only one way, i.e., 700131600 + 612265536 = 26460^2 + 24744^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1312397136.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4556791 + ... + 4557078.
Almost surely, 21312397136 is an apocalyptic number.
1312397136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1312397136 is an abundant number, since it is smaller than the sum of its proper divisors (2360492474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312397136 is a wasteful number, since it uses less digits than its factorization.
1312397136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9113883 (or 9113874 counting only the distinct ones).
The product of its digits is 20412, while the sum is 36.
The square root of 1312397136 is about 36227.0221795830. The cubic root of 1312397136 is about 1094.8511813767.
The spelling of 1312397136 in words is "one billion, three hundred twelve million, three hundred ninety-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •