Base | Representation |
---|---|
bin | 10110101111100110100111… |
… | …01101111100001001010101 |
3 | 20120002022021012012020022212 |
4 | 23113303103231330021111 |
5 | 23023412440203330122 |
6 | 254212103415203205 |
7 | 13351255202041421 |
oct | 1327632355741125 |
9 | 216068235166285 |
10 | 50014151230037 |
11 | 14a32978559725 |
12 | 57390b2076505 |
13 | 21ba411471887 |
14 | c4c9aac09b81 |
15 | 5baeb21b6ce2 |
hex | 2d7cd3b7c255 |
50014151230037 has 2 divisors, whose sum is σ = 50014151230038. Its totient is φ = 50014151230036.
The previous prime is 50014151230009. The next prime is 50014151230067. The reversal of 50014151230037 is 73003215141005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47903134021681 + 2111017208356 = 6921209^2 + 1452934^2 .
It is a cyclic number.
It is not a de Polignac number, because 50014151230037 - 216 = 50014151164501 is a prime.
It is a super-2 number, since 2×500141512300372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50014151229985 and 50014151230012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50014151230067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25007075615018 + 25007075615019.
It is an arithmetic number, because the mean of its divisors is an integer number (25007075615019).
Almost surely, 250014151230037 is an apocalyptic number.
It is an amenable number.
50014151230037 is a deficient number, since it is larger than the sum of its proper divisors (1).
50014151230037 is an equidigital number, since it uses as much as digits as its factorization.
50014151230037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 50014151230037 in words is "fifty trillion, fourteen billion, one hundred fifty-one million, two hundred thirty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •