Base | Representation |
---|---|
bin | 101011101100100010001… |
… | …0010111111101111001101 |
3 | 210021010021022210011001012 |
4 | 1113121010102333233031 |
5 | 1241343241042011112 |
6 | 20434520535455005 |
7 | 1156612065451235 |
oct | 127310422775715 |
9 | 23233238704035 |
10 | 6005510110157 |
11 | 1a05a169917a8 |
12 | 80baa9227465 |
13 | 347417aa34cc |
14 | 16a94d918cc5 |
15 | a633caa3022 |
hex | 576444bfbcd |
6005510110157 has 4 divisors (see below), whose sum is σ = 6005655976320. Its totient is φ = 6005364243996.
The previous prime is 6005510110151. The next prime is 6005510110163. The reversal of 6005510110157 is 7510110155006.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (6005510110151) and next prime (6005510110163).
It is a cyclic number.
It is not a de Polignac number, because 6005510110157 - 216 = 6005510044621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6005510110151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72871307 + ... + 72953672.
It is an arithmetic number, because the mean of its divisors is an integer number (1501413994080).
Almost surely, 26005510110157 is an apocalyptic number.
It is an amenable number.
6005510110157 is a deficient number, since it is larger than the sum of its proper divisors (145866163).
6005510110157 is a wasteful number, since it uses less digits than its factorization.
6005510110157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145866162.
The product of its (nonzero) digits is 5250, while the sum is 32.
The spelling of 6005510110157 in words is "six trillion, five billion, five hundred ten million, one hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •