Base | Representation |
---|---|
bin | 10110110011101011100100… |
… | …10100111111010111100011 |
3 | 20120120200220000001011010201 |
4 | 23121311302110333113203 |
5 | 23033211401303023301 |
6 | 254400313412210031 |
7 | 13364345046233110 |
oct | 1331656224772743 |
9 | 216520800034121 |
10 | 50154251220451 |
11 | 14a87331328074 |
12 | 5760291309917 |
13 | 21ca6aa972ba1 |
14 | c5569b825907 |
15 | 5be961a8a201 |
hex | 2d9d7253f5e3 |
50154251220451 has 16 divisors (see below), whose sum is σ = 58886386030080. Its totient is φ = 41819970208320.
The previous prime is 50154251220449. The next prime is 50154251220467. The reversal of 50154251220451 is 15402215245105.
It is a cyclic number.
It is not a de Polignac number, because 50154251220451 - 21 = 50154251220449 is a prime.
It is a super-2 number, since 2×501542512204512 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50154251220451.
It is not an unprimeable number, because it can be changed into a prime (50154251220851) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 251706591 + ... + 251905768.
It is an arithmetic number, because the mean of its divisors is an integer number (3680399126880).
Almost surely, 250154251220451 is an apocalyptic number.
50154251220451 is a deficient number, since it is larger than the sum of its proper divisors (8732134809629).
50154251220451 is a wasteful number, since it uses less digits than its factorization.
50154251220451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 503612754.
The product of its (nonzero) digits is 80000, while the sum is 37.
Adding to 50154251220451 its reverse (15402215245105), we get a palindrome (65556466465556).
The spelling of 50154251220451 in words is "fifty trillion, one hundred fifty-four billion, two hundred fifty-one million, two hundred twenty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •