Base | Representation |
---|---|
bin | 100100101110001100110… |
… | …0100111110111110111011 |
3 | 122212111020012110001210210 |
4 | 1021130121210332332323 |
5 | 1130142242004321423 |
6 | 14422322250042203 |
7 | 1030430516414052 |
oct | 111343144767673 |
9 | 18774205401723 |
10 | 5047015698363 |
11 | 1676477871621 |
12 | 69618b419363 |
13 | 2a7c15787c22 |
14 | 1363c39d9399 |
15 | 8b4400c3b93 |
hex | 4971993efbb |
5047015698363 has 8 divisors (see below), whose sum is σ = 7083530804800. Its totient is φ = 3187588862088.
The previous prime is 5047015698353. The next prime is 5047015698421. The reversal of 5047015698363 is 3638965107405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5047015698363 - 28 = 5047015698107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57), and also a Moran number because the ratio is a prime number: 88544135059 = 5047015698363 / (5 + 0 + 4 + 7 + 0 + 1 + 5 + 6 + 9 + 8 + 3 + 6 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5047015698313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44272067473 + ... + 44272067586.
It is an arithmetic number, because the mean of its divisors is an integer number (885441350600).
Almost surely, 25047015698363 is an apocalyptic number.
5047015698363 is a deficient number, since it is larger than the sum of its proper divisors (2036515106437).
5047015698363 is a wasteful number, since it uses less digits than its factorization.
5047015698363 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88544135081.
The product of its (nonzero) digits is 16329600, while the sum is 57.
The spelling of 5047015698363 in words is "five trillion, forty-seven billion, fifteen million, six hundred ninety-eight thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •