Base | Representation |
---|---|
bin | 101110100111100001… |
… | …000011011010010011 |
3 | 11210012102111112200111 |
4 | 232213201003122103 |
5 | 1310003101200201 |
6 | 34554530302151 |
7 | 3421261221205 |
oct | 564741033223 |
9 | 153172445614 |
10 | 50055100051 |
11 | 1a256887590 |
12 | 984b427957 |
13 | 49492c25c8 |
14 | 25cbb94775 |
15 | 147e62ab51 |
hex | ba7843693 |
50055100051 has 8 divisors (see below), whose sum is σ = 54616538304. Its totient is φ = 45495490920.
The previous prime is 50055100027. The next prime is 50055100087. The reversal of 50055100051 is 15000155005.
50055100051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50055100051 - 211 = 50055098003 is a prime.
It is a super-2 number, since 2×500551000512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50055099995 and 50055100031.
It is not an unprimeable number, because it can be changed into a prime (50055100351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 399741 + ... + 509806.
It is an arithmetic number, because the mean of its divisors is an integer number (6827067288).
Almost surely, 250055100051 is an apocalyptic number.
50055100051 is a deficient number, since it is larger than the sum of its proper divisors (4561438253).
50055100051 is a wasteful number, since it uses less digits than its factorization.
50055100051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 914561.
The product of its (nonzero) digits is 625, while the sum is 22.
Adding to 50055100051 its reverse (15000155005), we get a palindrome (65055255056).
The spelling of 50055100051 in words is "fifty billion, fifty-five million, one hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •