Base | Representation |
---|---|
bin | 100001111000101… |
… | …0111100010110100 |
3 | 2221020111100022100 |
4 | 1003301113202310 |
5 | 4312033434324 |
6 | 304454102100 |
7 | 40114316301 |
oct | 10361274264 |
9 | 2836440270 |
10 | 1137014964 |
11 | 5338a7198 |
12 | 27894a930 |
13 | 151740927 |
14 | ab0160a8 |
15 | 69c484c9 |
hex | 43c578b4 |
1137014964 has 18 divisors (see below), whose sum is σ = 2874121250. Its totient is φ = 379004976.
The previous prime is 1137014953. The next prime is 1137014969. The reversal of 1137014964 is 4694107311.
It can be written as a sum of positive squares in only one way, i.e., 966712464 + 170302500 = 31092^2 + 13050^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 31583749 = 1137014964 / (1 + 1 + 3 + 7 + 0 + 1 + 4 + 9 + 6 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1137014969) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15791839 + ... + 15791910.
Almost surely, 21137014964 is an apocalyptic number.
It is an amenable number.
1137014964 is an abundant number, since it is smaller than the sum of its proper divisors (1737106286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1137014964 is a wasteful number, since it uses less digits than its factorization.
1137014964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31583759 (or 31583754 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 1137014964 is about 33719.6524893125. The cubic root of 1137014964 is about 1043.7313462955.
The spelling of 1137014964 in words is "one billion, one hundred thirty-seven million, fourteen thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •