Base | Representation |
---|---|
bin | 100100101111100111000… |
… | …1010100101101011001011 |
3 | 122212210001100110122122110 |
4 | 1021133032022211223023 |
5 | 1130214443114030201 |
6 | 14423543040153403 |
7 | 1030565556052662 |
oct | 111371612455313 |
9 | 18783040418573 |
10 | 5050045455051 |
11 | 1677792006673 |
12 | 696896008863 |
13 | 2a82a938a76c |
14 | 1365d0149dd9 |
15 | 8b56b0946d6 |
hex | 497ce2a5acb |
5050045455051 has 4 divisors (see below), whose sum is σ = 6733393940072. Its totient is φ = 3366696970032.
The previous prime is 5050045455041. The next prime is 5050045455053. The reversal of 5050045455051 is 1505545400505.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5050045455051 - 25 = 5050045455019 is a prime.
It is a super-2 number, since 2×50500454550512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5050045455053) 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 3 ways as a sum of consecutive naturals, for example, 841674242506 + ... + 841674242511.
It is an arithmetic number, because the mean of its divisors is an integer number (1683348485018).
Almost surely, 25050045455051 is an apocalyptic number.
5050045455051 is a deficient number, since it is larger than the sum of its proper divisors (1683348485021).
5050045455051 is a wasteful number, since it uses less digits than its factorization.
5050045455051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683348485020.
The product of its (nonzero) digits is 250000, while the sum is 39.
It can be divided in two parts, 50500454 and 55051, that added together give a palindrome (50555505).
The spelling of 5050045455051 in words is "five trillion, fifty billion, forty-five million, four hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •