Base | Representation |
---|---|
bin | 101000000011111101011… |
… | …0001001110001011101010 |
3 | 201111101002210212122122200 |
4 | 1100013322301032023222 |
5 | 1210202402420011242 |
6 | 15413241005201030 |
7 | 1105541210310462 |
oct | 120077261161352 |
9 | 21441083778580 |
10 | 5506060313322 |
11 | 183311a560068 |
12 | 74b140560176 |
13 | 30c2b093754a |
14 | 1506cd7d8ba2 |
15 | 9835a40304c |
hex | 501fac4e2ea |
5506060313322 has 24 divisors (see below), whose sum is σ = 12131997302880. Its totient is φ = 1804245752040.
The previous prime is 5506060313321. The next prime is 5506060313323. The reversal of 5506060313322 is 2233130606055.
5506060313322 is a `hidden beast` number, since 5 + 5 + 0 + 6 + 0 + 603 + 13 + 32 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (5506060313321) and next prime (5506060313323).
It is not an unprimeable number, because it can be changed into a prime (5506060313321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2592306054 + ... + 2592308177.
It is an arithmetic number, because the mean of its divisors is an integer number (505499887620).
Almost surely, 25506060313322 is an apocalyptic number.
5506060313322 is an abundant number, since it is smaller than the sum of its proper divisors (6625936989558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5506060313322 is a wasteful number, since it uses less digits than its factorization.
5506060313322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5184614298 (or 5184614295 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 36.
Adding to 5506060313322 its reverse (2233130606055), we get a palindrome (7739190919377).
The spelling of 5506060313322 in words is "five trillion, five hundred six billion, sixty million, three hundred thirteen thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •