Base | Representation |
---|---|
bin | 1010000110111100… |
… | …0000001001100101 |
3 | 21000002211200222002 |
4 | 2201233000021211 |
5 | 21024121000112 |
6 | 1125130415045 |
7 | 124145654102 |
oct | 24157001145 |
9 | 7002750862 |
10 | 2713453157 |
11 | 1172745578 |
12 | 638891485 |
13 | 343216cac |
14 | 1ba535aa9 |
15 | 10d3411c2 |
hex | a1bc0265 |
2713453157 has 8 divisors (see below), whose sum is σ = 2815065600. Its totient is φ = 2612720880.
The previous prime is 2713453139. The next prime is 2713453187. The reversal of 2713453157 is 7513543172.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2713453157 - 28 = 2713452901 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2713453157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2713453187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 213758 + ... + 226095.
It is an arithmetic number, because the mean of its divisors is an integer number (351883200).
Almost surely, 22713453157 is an apocalyptic number.
It is an amenable number.
2713453157 is a deficient number, since it is larger than the sum of its proper divisors (101612443).
2713453157 is a wasteful number, since it uses less digits than its factorization.
2713453157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440083.
The product of its digits is 88200, while the sum is 38.
The square root of 2713453157 is about 52090.8164362971. The cubic root of 2713453157 is about 1394.7855610910.
The spelling of 2713453157 in words is "two billion, seven hundred thirteen million, four hundred fifty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •