Base | Representation |
---|---|
bin | 101011000000100101100… |
… | …0110111101000100000010 |
3 | 202221002200011120120201200 |
4 | 1112001023012331010002 |
5 | 1233322001042112344 |
6 | 20323312112042030 |
7 | 1150031303304303 |
oct | 126011306750402 |
9 | 22832604516650 |
10 | 5911135113474 |
11 | 1979997739978 |
12 | 7b574b233316 |
13 | 33b557763ac6 |
14 | 1661599707aa |
15 | a3b675cb069 |
hex | 5604b1bd102 |
5911135113474 has 192 divisors, whose sum is σ = 13499927700480. Its totient is φ = 1867038750720.
The previous prime is 5911135113449. The next prime is 5911135113509. The reversal of 5911135113474 is 4743115311195.
5911135113474 is a `hidden beast` number, since 5 + 9 + 1 + 113 + 51 + 13 + 474 = 666.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 2533704412 + ... + 2533706744.
It is an arithmetic number, because the mean of its divisors is an integer number (70312123440).
Almost surely, 25911135113474 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5911135113474, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6749963850240).
5911135113474 is an abundant number, since it is smaller than the sum of its proper divisors (7588792587006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5911135113474 is a wasteful number, since it uses less digits than its factorization.
5911135113474 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2937 (or 2934 counting only the distinct ones).
The product of its digits is 226800, while the sum is 45.
The spelling of 5911135113474 in words is "five trillion, nine hundred eleven billion, one hundred thirty-five million, one hundred thirteen thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •