Base | Representation |
---|---|
bin | 10110110000101001011000… |
… | …11111000111100000011011 |
3 | 20120012201210120110101120021 |
4 | 23120110230133013200123 |
5 | 23030004400031130003 |
6 | 254240352552211311 |
7 | 13353664443525250 |
oct | 1330245437074033 |
9 | 216181716411507 |
10 | 50050000255003 |
11 | 14a470a4385791 |
12 | 5744037999b37 |
13 | 21c0905551a98 |
14 | c5060bda3427 |
15 | 5bbdae5552bd |
hex | 2d852c7c781b |
50050000255003 has 64 divisors (see below), whose sum is σ = 65071179187200. Its totient is φ = 37468113408000.
The previous prime is 50050000254983. The next prime is 50050000255033. The reversal of 50050000255003 is 30055200005005.
50050000255003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 50050000255003 - 25 = 50050000254971 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50050000255033) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 20369253 + ... + 22693753.
It is an arithmetic number, because the mean of its divisors is an integer number (1016737174800).
Almost surely, 250050000255003 is an apocalyptic number.
50050000255003 is a deficient number, since it is larger than the sum of its proper divisors (15021178932197).
50050000255003 is a wasteful number, since it uses less digits than its factorization.
50050000255003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2324740.
The product of its (nonzero) digits is 3750, while the sum is 25.
It can be divided in two parts, 500500002 and 55003, that added together give a palindrome (500555005).
The spelling of 50050000255003 in words is "fifty trillion, fifty billion, two hundred fifty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •