Base | Representation |
---|---|
bin | 100111001011010000011… |
… | …0110101011111000001111 |
3 | 201001201210121122120220210 |
4 | 1032112200312223320033 |
5 | 1201204012413240301 |
6 | 15241302051013503 |
7 | 1064000535626346 |
oct | 116264066537017 |
9 | 21051717576823 |
10 | 5384292711951 |
11 | 179651395a96a |
12 | 72b61889a293 |
13 | 300976494b0a |
14 | 14885b810b5d |
15 | 950d0193ad6 |
hex | 4e5a0dabe0f |
5384292711951 has 16 divisors (see below), whose sum is σ = 7602758047584. Its totient is φ = 3377755905024.
The previous prime is 5384292711947. The next prime is 5384292711989. The reversal of 5384292711951 is 1591172924835.
It is not a de Polignac number, because 5384292711951 - 22 = 5384292711947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5384292711891 and 5384292711900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5384292711851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9468460 + ... + 10020993.
It is an arithmetic number, because the mean of its divisors is an integer number (475172377974).
Almost surely, 25384292711951 is an apocalyptic number.
5384292711951 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5384292711951 is a deficient number, since it is larger than the sum of its proper divisors (2218465335633).
5384292711951 is a wasteful number, since it uses less digits than its factorization.
5384292711951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19494890.
The product of its digits is 5443200, while the sum is 57.
The spelling of 5384292711951 in words is "five trillion, three hundred eighty-four billion, two hundred ninety-two million, seven hundred eleven thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •