Base | Representation |
---|---|
bin | 10110101111101000001101… |
… | …11110010001100101000111 |
3 | 20120002101111010021200221222 |
4 | 23113310012332101211013 |
5 | 23023421220323301101 |
6 | 254212325014230555 |
7 | 13351315413200225 |
oct | 1327640676214507 |
9 | 216071433250858 |
10 | 50015011150151 |
11 | 14a332799a6403 |
12 | 57392b205545b |
13 | 21ba51a674248 |
14 | c4ca4d0d1b15 |
15 | 5bb01292801b |
hex | 2d7d06f91947 |
50015011150151 has 4 divisors (see below), whose sum is σ = 50019384249912. Its totient is φ = 50010638050392.
The previous prime is 50015011150133. The next prime is 50015011150171. The reversal of 50015011150151 is 15105111051005.
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 50015011150151 - 242 = 45616964639047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50015011150151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50015011150121) 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, 2186532725 + ... + 2186555598.
It is an arithmetic number, because the mean of its divisors is an integer number (12504846062478).
Almost surely, 250015011150151 is an apocalyptic number.
50015011150151 is a deficient number, since it is larger than the sum of its proper divisors (4373099761).
50015011150151 is a wasteful number, since it uses less digits than its factorization.
50015011150151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4373099760.
The product of its (nonzero) digits is 625, while the sum is 26.
The spelling of 50015011150151 in words is "fifty trillion, fifteen billion, eleven million, one hundred fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •