Base | Representation |
---|---|
bin | 100110100110101001001… |
… | …1011111000100111010011 |
3 | 200210012212002201201011020 |
4 | 1031031102123320213103 |
5 | 1143412001404331201 |
6 | 15141220131050523 |
7 | 1055215250635434 |
oct | 115152233704723 |
9 | 20705762651136 |
10 | 5305667652051 |
11 | 1766137086718 |
12 | 718335440a43 |
13 | 2c6426176230 |
14 | 144b1d50348b |
15 | 9302c769a36 |
hex | 4d3526f89d3 |
5305667652051 has 32 divisors (see below), whose sum is σ = 7874377082880. Its totient is φ = 3155593420800.
The previous prime is 5305667652023. The next prime is 5305667652137. The reversal of 5305667652051 is 1502567665035.
It is a de Polignac number, because none of the positive numbers 2k-5305667652051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5305667651985 and 5305667652003.
It is not an unprimeable number, because it can be changed into a prime (5305667652151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1923645 + ... + 3783086.
It is an arithmetic number, because the mean of its divisors is an integer number (246074283840).
Almost surely, 25305667652051 is an apocalyptic number.
5305667652051 is a deficient number, since it is larger than the sum of its proper divisors (2568709430829).
5305667652051 is a wasteful number, since it uses less digits than its factorization.
5305667652051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5707547.
The product of its (nonzero) digits is 5670000, while the sum is 51.
The spelling of 5305667652051 in words is "five trillion, three hundred five billion, six hundred sixty-seven million, six hundred fifty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •