Base | Representation |
---|---|
bin | 101011010010001000001… |
… | …1011000000001011110001 |
3 | 210001200220110112012221100 |
4 | 1112210100123000023301 |
5 | 1234431123114002212 |
6 | 20352502101115013 |
7 | 1152533640025101 |
oct | 126442033001361 |
9 | 23050813465840 |
10 | 5948805219057 |
11 | 1993968508838 |
12 | 800b029b8a69 |
13 | 341c7bc052cc |
14 | 167cd092b201 |
15 | a4b1e788bdc |
hex | 569106c02f1 |
5948805219057 has 12 divisors (see below), whose sum is σ = 8592787751184. Its totient is φ = 3965838253080.
The previous prime is 5948805219047. The next prime is 5948805219059. The reversal of 5948805219057 is 7509125088495.
5948805219057 is a `hidden beast` number, since 59 + 4 + 8 + 8 + 0 + 521 + 9 + 0 + 57 = 666.
It is not a de Polignac number, because 5948805219057 - 24 = 5948805219041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5948805218985 and 5948805219003.
It is not an unprimeable number, because it can be changed into a prime (5948805219059) 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 11 ways as a sum of consecutive naturals, for example, 1447419 + ... + 3740672.
It is an arithmetic number, because the mean of its divisors is an integer number (716065645932).
Almost surely, 25948805219057 is an apocalyptic number.
It is an amenable number.
5948805219057 is a deficient number, since it is larger than the sum of its proper divisors (2643982532127).
5948805219057 is a wasteful number, since it uses less digits than its factorization.
5948805219057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5315500 (or 5315497 counting only the distinct ones).
The product of its (nonzero) digits is 36288000, while the sum is 63.
The spelling of 5948805219057 in words is "five trillion, nine hundred forty-eight billion, eight hundred five million, two hundred nineteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •