Base | Representation |
---|---|
bin | 10111000101100101000000… |
… | …01111010101011000001001 |
3 | 20122202111011222002000000221 |
4 | 23202302200033111120021 |
5 | 23123300311131004001 |
6 | 255551014353430041 |
7 | 13456645102101400 |
oct | 1342624017253011 |
9 | 218674158060027 |
10 | 50769201813001 |
11 | 151a4108967081 |
12 | 583b4b2b6b321 |
13 | 2243690b3a959 |
14 | c7735750c637 |
15 | 5d095420d1a1 |
hex | 2e2ca03d5609 |
50769201813001 has 27 divisors (see below), whose sum is σ = 59734303479189. Its totient is φ = 43023747590208.
The previous prime is 50769201812999. The next prime is 50769201813067. The reversal of 50769201813001 is 10031810296705.
The square root of 50769201813001 is 7125251.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 13447805765625 + 37321396047376 = 3667125^2 + 6109124^2 .
It is not a de Polignac number, because 50769201813001 - 21 = 50769201812999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50769201817001) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4439025655 + ... + 4439037091.
Almost surely, 250769201813001 is an apocalyptic number.
50769201813001 is the 7125251-st square number.
50769201813001 is the 3562626-th centered octagonal number.
It is an amenable number.
50769201813001 is a deficient number, since it is larger than the sum of its proper divisors (8965101666188).
50769201813001 is an frugal number, since it uses more digits than its factorization.
50769201813001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23066 (or 11533 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 43.
The spelling of 50769201813001 in words is "fifty trillion, seven hundred sixty-nine billion, two hundred one million, eight hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •