Base | Representation |
---|---|
bin | 100100101111110100110… |
… | …0011110011100110001001 |
3 | 122212211020101021112002022 |
4 | 1021133221203303212021 |
5 | 1130221413243104010 |
6 | 14424100415014225 |
7 | 1030613136415265 |
oct | 111375143634611 |
9 | 18784211245068 |
10 | 5050505050505 |
11 | 16779a8486522 |
12 | 6969a3b0a375 |
13 | 2a8350666b35 |
14 | 1366351c50a5 |
15 | 8b5965cad55 |
hex | 497e98f3989 |
5050505050505 has 16 divisors (see below), whose sum is σ = 6087280032000. Its totient is φ = 4022628704640.
The previous prime is 5050505050433. The next prime is 5050505050541.
5050505050505 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5050505050505 - 216 = 5050504984969 is a prime.
It is an alternating number because its digits alternate between odd and even.
5050505050505 is an undulating number in base 10.
5050505050505 is a modest number, since divided by 5050505 gives 50505 as remainder.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5101010 + ... + 6010100.
It is an arithmetic number, because the mean of its divisors is an integer number (380455002000).
Almost surely, 25050505050505 is an apocalyptic number.
It is an amenable number.
5050505050505 is a deficient number, since it is larger than the sum of its proper divisors (1036774981495).
5050505050505 is a wasteful number, since it uses less digits than its factorization.
5050505050505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913984.
The product of its (nonzero) digits is 78125, while the sum is 35.
It can be divided in two parts, 505050 and 5050505, that added together give a palindrome (5555555).
The spelling of 5050505050505 in words is "five trillion, fifty billion, five hundred five million, fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •