Base | Representation |
---|---|
bin | 1001010110110010… |
… | …11010110101011101 |
3 | 110222001202102201200 |
4 | 10223121122311131 |
5 | 40241400113401 |
6 | 2150233230113 |
7 | 235322141565 |
oct | 45331326535 |
9 | 13861672650 |
10 | 5023051101 |
11 | 2148421702 |
12 | b82262339 |
13 | 62086c9b3 |
14 | 359181da5 |
15 | 1e5eab686 |
hex | 12b65ad5d |
5023051101 has 12 divisors (see below), whose sum is σ = 7264281180. Its totient is φ = 3344656320.
The previous prime is 5023051093. The next prime is 5023051123. The reversal of 5023051101 is 1011503205.
It can be written as a sum of positive squares in 2 ways, for example, as 4296802500 + 726248601 = 65550^2 + 26949^2 .
It is not a de Polignac number, because 5023051101 - 23 = 5023051093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5023051181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 329160 + ... + 344081.
It is an arithmetic number, because the mean of its divisors is an integer number (605356765).
Almost surely, 25023051101 is an apocalyptic number.
It is an amenable number.
5023051101 is a deficient number, since it is larger than the sum of its proper divisors (2241230079).
5023051101 is a wasteful number, since it uses less digits than its factorization.
5023051101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674076 (or 674073 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 5023051101 is about 70873.4865870164. The cubic root of 5023051101 is about 1712.5997073102.
Adding to 5023051101 its reverse (1011503205), we get a palindrome (6034554306).
The spelling of 5023051101 in words is "five billion, twenty-three million, fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •