Base | Representation |
---|---|
bin | 1001011100011001… |
… | …01110011010111101 |
3 | 111002100012111002120 |
4 | 10232030232122331 |
5 | 40340413230401 |
6 | 2155032513153 |
7 | 236432520516 |
oct | 45614563275 |
9 | 14070174076 |
10 | 5070055101 |
11 | 2171a06491 |
12 | b95b4b7b9 |
13 | 62a519507 |
14 | 3614d9a0d |
15 | 1ea193836 |
hex | 12e32e6bd |
5070055101 has 8 divisors (see below), whose sum is σ = 6887622240. Its totient is φ = 3316262352.
The previous prime is 5070055099. The next prime is 5070055147. The reversal of 5070055101 is 1015500705.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5070055101 - 21 = 5070055099 is a prime.
It is a super-2 number, since 2×50700551012 = 51410917454352240402, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5070050101) 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 7 ways as a sum of consecutive naturals, for example, 15943411 + ... + 15943728.
It is an arithmetic number, because the mean of its divisors is an integer number (860952780).
Almost surely, 25070055101 is an apocalyptic number.
It is an amenable number.
5070055101 is a deficient number, since it is larger than the sum of its proper divisors (1817567139).
5070055101 is a wasteful number, since it uses less digits than its factorization.
5070055101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31887195.
The product of its (nonzero) digits is 875, while the sum is 24.
The square root of 5070055101 is about 71204.3193984747. The cubic root of 5070055101 is about 1717.9251053682.
Adding to 5070055101 its reverse (1015500705), we get a palindrome (6085555806).
The spelling of 5070055101 in words is "five billion, seventy million, fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •