Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …00101100111000100001011 |
3 | 20121211020020021212002110111 |
4 | 23132330130211213010023 |
5 | 23104433220003230201 |
6 | 255225402101055151 |
7 | 13431602661154453 |
oct | 1336743445470413 |
9 | 217736207762414 |
10 | 50505000055051 |
11 | 15102060960993 |
12 | 57b825a3b74b7 |
13 | 22247a771b6b9 |
14 | c68652904d63 |
15 | 5c8b3e70ab51 |
hex | 2def1c96710b |
50505000055051 has 4 divisors (see below), whose sum is σ = 50506297722504. Its totient is φ = 50503702387600.
The previous prime is 50505000055001. The next prime is 50505000055121. The reversal of 50505000055051 is 15055000050505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50505000055051 - 223 = 50504991666443 is a prime.
It is a super-2 number, since 2×505050000550512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50505000055001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 648775345 + ... + 648853186.
It is an arithmetic number, because the mean of its divisors is an integer number (12626574430626).
Almost surely, 250505000055051 is an apocalyptic number.
50505000055051 is a deficient number, since it is larger than the sum of its proper divisors (1297667453).
50505000055051 is a wasteful number, since it uses less digits than its factorization.
50505000055051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297667452.
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 50505000055051 in words is "fifty trillion, five hundred five billion, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •