Base | Representation |
---|---|
bin | 1001111110010001… |
… | …01001101111110011 |
3 | 111211010212112200121 |
4 | 10333020221233303 |
5 | 41431133400201 |
6 | 2243143031111 |
7 | 246452643454 |
oct | 47710515763 |
9 | 14733775617 |
10 | 5354200051 |
11 | 22a8340822 |
12 | 105513b497 |
13 | 674355715 |
14 | 38b14312b |
15 | 2150be9a1 |
hex | 13f229bf3 |
5354200051 has 4 divisors (see below), whose sum is σ = 5382232704. Its totient is φ = 5326167400.
The previous prime is 5354200043. The next prime is 5354200063. The reversal of 5354200051 is 1500024535.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5354200051 - 23 = 5354200043 is a prime.
It is a super-2 number, since 2×53542000512 = 57334916372256805202, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5354199989 and 5354200025.
It is not an unprimeable number, because it can be changed into a prime (5354200001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14016040 + ... + 14016421.
It is an arithmetic number, because the mean of its divisors is an integer number (1345558176).
Almost surely, 25354200051 is an apocalyptic number.
5354200051 is a deficient number, since it is larger than the sum of its proper divisors (28032653).
5354200051 is a wasteful number, since it uses less digits than its factorization.
5354200051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28032652.
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 5354200051 is about 73172.3995164844. The cubic root of 5354200051 is about 1749.4365588553.
Adding to 5354200051 its reverse (1500024535), we get a palindrome (6854224586).
The spelling of 5354200051 in words is "five billion, three hundred fifty-four million, two hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •