Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …01001101101101001100001 |
3 | 20121210210220000201120020100 |
4 | 23132320112221231221201 |
5 | 23104400220002000001 |
6 | 255223354034333013 |
7 | 13431356040104556 |
oct | 1336702651555141 |
9 | 217723800646210 |
10 | 50500605500001 |
11 | 15100206290708 |
12 | 57b743272a169 |
13 | 2224257143b77 |
14 | c68357006a2d |
15 | 5c89839ea586 |
hex | 2dee16a6da61 |
50500605500001 has 6 divisors (see below), whose sum is σ = 72945319055570. Its totient is φ = 33667070333328.
The previous prime is 50500605499837. The next prime is 50500605500011. The reversal of 50500605500001 is 10000550600505.
50500605500001 is a `hidden beast` number, since 5 + 0 + 5 + 0 + 0 + 605 + 50 + 0 + 0 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 32577439752225 + 17923165747776 = 5707665^2 + 4233576^2 .
It is not a de Polignac number, because 50500605500001 - 214 = 50500605483617 is a prime.
It is a super-2 number, since 2×505006055000012 (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 (50500605500011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2805589194436 + ... + 2805589194453.
Almost surely, 250500605500001 is an apocalyptic number.
It is an amenable number.
50500605500001 is a deficient number, since it is larger than the sum of its proper divisors (22444713555569).
50500605500001 is a wasteful number, since it uses less digits than its factorization.
50500605500001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5611178388895 (or 5611178388892 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 50500605500001 in words is "fifty trillion, five hundred billion, six hundred five million, five hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •