Base | Representation |
---|---|
bin | 1001100001101011… |
… | …11011111001101111 |
3 | 111012102200002012221 |
4 | 10300311323321233 |
5 | 40433242201110 |
6 | 2203255340211 |
7 | 240511535032 |
oct | 46065737157 |
9 | 14172602187 |
10 | 5114412655 |
11 | 2194a52a20 |
12 | ba8981667 |
13 | 63677a5a1 |
14 | 367365019 |
15 | 1ee0067da |
hex | 130d7be6f |
5114412655 has 8 divisors (see below), whose sum is σ = 6695231184. Its totient is φ = 3719572800.
The previous prime is 5114412593. The next prime is 5114412661. The reversal of 5114412655 is 5562144115.
5114412655 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5114412655 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 5114412655.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46494606 + ... + 46494715.
It is an arithmetic number, because the mean of its divisors is an integer number (836903898).
Almost surely, 25114412655 is an apocalyptic number.
5114412655 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5114412655 is a deficient number, since it is larger than the sum of its proper divisors (1580818529).
5114412655 is a wasteful number, since it uses less digits than its factorization.
5114412655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92989337.
The product of its digits is 24000, while the sum is 34.
The square root of 5114412655 is about 71515.1218624425. The cubic root of 5114412655 is about 1722.9205670604.
The spelling of 5114412655 in words is "five billion, one hundred fourteen million, four hundred twelve thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •