Base | Representation |
---|---|
bin | 101000110100011011100… |
… | …0101111111001100111011 |
3 | 201212022210010000011001200 |
4 | 1101220313011333030323 |
5 | 1213404042302330201 |
6 | 15533133522545243 |
7 | 1116214533555300 |
oct | 121506705771473 |
9 | 21768703004050 |
10 | 5610151605051 |
11 | 18732853631a4 |
12 | 767350508223 |
13 | 31905bc50566 |
14 | 155765d750a7 |
15 | 9aded8e7386 |
hex | 51a3717f33b |
5610151605051 has 72 divisors (see below), whose sum is σ = 9732321316224. Its totient is φ = 3101859774720.
The previous prime is 5610151605007. The next prime is 5610151605053. The reversal of 5610151605051 is 1505061510165.
It is a happy number.
It is not a de Polignac number, because 5610151605051 - 210 = 5610151604027 is a prime.
It is a super-2 number, since 2×56101516050512 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5610151604997 and 5610151605015.
It is not an unprimeable number, because it can be changed into a prime (5610151605053) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 88460685 + ... + 88524081.
It is an arithmetic number, because the mean of its divisors is an integer number (135171129392).
Almost surely, 25610151605051 is an apocalyptic number.
5610151605051 is a deficient number, since it is larger than the sum of its proper divisors (4122169711173).
5610151605051 is a wasteful number, since it uses less digits than its factorization.
5610151605051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69921 (or 69911 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 5610151605051 in words is "five trillion, six hundred ten billion, one hundred fifty-one million, six hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •