Base | Representation |
---|---|
bin | 100101100000111110010… |
… | …0010001101111110000101 |
3 | 200020220122222220120101021 |
4 | 1023001330202031332011 |
5 | 1133434042311200401 |
6 | 14544353503431141 |
7 | 1041340504504165 |
oct | 113017442157605 |
9 | 20226588816337 |
10 | 5156050100101 |
11 | 170873995543a |
12 | 6b333a8b54b1 |
13 | 2b52a0c012c4 |
14 | 13b7a88685a5 |
15 | 8e1c25332a1 |
hex | 4b07c88df85 |
5156050100101 has 4 divisors (see below), whose sum is σ = 5159512861900. Its totient is φ = 5152587338304.
The previous prime is 5156050100083. The next prime is 5156050100129. The reversal of 5156050100101 is 1010010506515.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 323641521025 + 4832408579076 = 568895^2 + 2198274^2 .
It is a cyclic number.
It is not a de Polignac number, because 5156050100101 - 27 = 5156050099973 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 (5156050107101) 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, 1731378666 + ... + 1731381643.
It is an arithmetic number, because the mean of its divisors is an integer number (1289878215475).
Almost surely, 25156050100101 is an apocalyptic number.
It is an amenable number.
5156050100101 is a deficient number, since it is larger than the sum of its proper divisors (3462761799).
5156050100101 is a wasteful number, since it uses less digits than its factorization.
5156050100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3462761798.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 5156050100101 its reverse (1010010506515), we get a palindrome (6166060606616).
The spelling of 5156050100101 in words is "five trillion, one hundred fifty-six billion, fifty million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •