Base | Representation |
---|---|
bin | 1001110010100000… |
… | …11010111101110001 |
3 | 111120021021210022020 |
4 | 10321100122331301 |
5 | 41230411321421 |
6 | 2225301102053 |
7 | 244144431213 |
oct | 47120327561 |
9 | 14507253266 |
10 | 5255573361 |
11 | 22576a8065 |
12 | 10280b7929 |
13 | 659aa302c |
14 | 37bdcc5b3 |
15 | 20b5dbdc6 |
hex | 13941af71 |
5255573361 has 8 divisors (see below), whose sum is σ = 7008753504. Its totient is φ = 3503054400.
The previous prime is 5255573359. The next prime is 5255573383. The reversal of 5255573361 is 1633755525.
It is a happy number.
5255573361 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 not a de Polignac number, because 5255573361 - 21 = 5255573359 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5255575361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146440 + ... + 178761.
It is an arithmetic number, because the mean of its divisors is an integer number (876094188).
Almost surely, 25255573361 is an apocalyptic number.
It is an amenable number.
5255573361 is a deficient number, since it is larger than the sum of its proper divisors (1753180143).
5255573361 is a wasteful number, since it uses less digits than its factorization.
5255573361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330591.
The product of its digits is 472500, while the sum is 42.
The square root of 5255573361 is about 72495.3333739490. Note that the first 4 decimals coincide. The cubic root of 5255573361 is about 1738.6281256151.
The spelling of 5255573361 in words is "five billion, two hundred fifty-five million, five hundred seventy-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •