Base | Representation |
---|---|
bin | 1010000111001011… |
… | …1111111010011100 |
3 | 21000011210221000100 |
4 | 2201302333322130 |
5 | 21024403011024 |
6 | 1125205101100 |
7 | 124160606253 |
oct | 24162777234 |
9 | 7004727010 |
10 | 2714500764 |
11 | 11732a0668 |
12 | 6390b7790 |
13 | 3434c2a91 |
14 | 1ba72979a |
15 | 10d49b7c9 |
hex | a1cbfe9c |
2714500764 has 18 divisors (see below), whose sum is σ = 6861654800. Its totient is φ = 904833576.
The previous prime is 2714500703. The next prime is 2714500769. The reversal of 2714500764 is 4670054172.
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: 75402799 = 2714500764 / (2 + 7 + 1 + 4 + 5 + 0 + 0 + 7 + 6 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2714500769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 37701364 + ... + 37701435.
Almost surely, 22714500764 is an apocalyptic number.
It is an amenable number.
2714500764 is an abundant number, since it is smaller than the sum of its proper divisors (4147154036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2714500764 is a wasteful number, since it uses less digits than its factorization.
2714500764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75402809 (or 75402804 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The square root of 2714500764 is about 52100.8710483808. The cubic root of 2714500764 is about 1394.9650370857.
The spelling of 2714500764 in words is "two billion, seven hundred fourteen million, five hundred thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •