Base | Representation |
---|---|
bin | 1001011010000100… |
… | …10010000010001001 |
3 | 111000222111000122022 |
4 | 10231002102002021 |
5 | 40320414241134 |
6 | 2153054334225 |
7 | 236104611623 |
oct | 45502220211 |
9 | 14028430568 |
10 | 5050540169 |
11 | 2161997644 |
12 | b8b4ba375 |
13 | 626475b0c |
14 | 35ca99c13 |
15 | 1e85db52e |
hex | 12d092089 |
5050540169 has 16 divisors (see below), whose sum is σ = 5308243200. Its totient is φ = 4796151360.
The previous prime is 5050540141. The next prime is 5050540171. The reversal of 5050540169 is 9610450505.
5050540169 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5050540169 - 28 = 5050539913 is a prime.
It is a super-2 number, since 2×50505401692 = 51015911997365097122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5050540139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1980107 + ... + 1982655.
It is an arithmetic number, because the mean of its divisors is an integer number (331765200).
Almost surely, 25050540169 is an apocalyptic number.
It is an amenable number.
5050540169 is a deficient number, since it is larger than the sum of its proper divisors (257703031).
5050540169 is a wasteful number, since it uses less digits than its factorization.
5050540169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3160.
The product of its (nonzero) digits is 27000, while the sum is 35.
The square root of 5050540169 is about 71067.1525319539. The cubic root of 5050540169 is about 1715.7181407088.
The spelling of 5050540169 in words is "five billion, fifty million, five hundred forty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •