Base | Representation |
---|---|
bin | 10110111000101011011111… |
… | …00010100101110110100111 |
3 | 20121012010012200120222112001 |
4 | 23130111233202211312213 |
5 | 23044020123301134101 |
6 | 255011240252110131 |
7 | 13412635162431265 |
oct | 1334255742456647 |
9 | 217163180528461 |
10 | 50326003146151 |
11 | 15043157863a17 |
12 | 5789624765347 |
13 | 221094c8572a5 |
14 | c5db1201d435 |
15 | 5c41650e4901 |
hex | 2dc56f8a5da7 |
50326003146151 has 2 divisors, whose sum is σ = 50326003146152. Its totient is φ = 50326003146150.
The previous prime is 50326003146143. The next prime is 50326003146163. The reversal of 50326003146151 is 15164130062305.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50326003146151 - 23 = 50326003146143 is a prime.
It is a super-2 number, since 2×503260031461512 (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 50326003146151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50326003146101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25163001573075 + 25163001573076.
It is an arithmetic number, because the mean of its divisors is an integer number (25163001573076).
Almost surely, 250326003146151 is an apocalyptic number.
50326003146151 is a deficient number, since it is larger than the sum of its proper divisors (1).
50326003146151 is an equidigital number, since it uses as much as digits as its factorization.
50326003146151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 50326003146151 in words is "fifty trillion, three hundred twenty-six billion, three million, one hundred forty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •