Base | Representation |
---|---|
bin | 100010010011111101101111… |
… | …001010100011100111011001 |
3 | 201210022102120121120222202000 |
4 | 202103331233022203213121 |
5 | 124234414021442431012 |
6 | 1252541014250031213 |
7 | 43533364661130144 |
oct | 4223755712434731 |
9 | 653272517528660 |
10 | 150905540983257 |
11 | 440a0753870865 |
12 | 14b12608418509 |
13 | 6628440287c28 |
14 | 2939c1d68705b |
15 | 126a5ed123ddc |
hex | 893f6f2a39d9 |
150905540983257 has 16 divisors (see below), whose sum is σ = 223567977338880. Its totient is φ = 100601798175216.
The previous prime is 150905540983217. The next prime is 150905540983291. The reversal of 150905540983257 is 752389045509051.
150905540983257 is a `hidden beast` number, since 1 + 5 + 0 + 9 + 0 + 5 + 540 + 9 + 8 + 32 + 57 = 666.
It is not a de Polignac number, because 150905540983257 - 210 = 150905540982233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 150905540983194 and 150905540983203.
It is not an unprimeable number, because it can be changed into a prime (150905540983217) 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, 51201433 + ... + 54068454.
It is an arithmetic number, because the mean of its divisors is an integer number (13972998583680).
Almost surely, 2150905540983257 is an apocalyptic number.
It is an amenable number.
150905540983257 is a deficient number, since it is larger than the sum of its proper divisors (72662436355623).
150905540983257 is a wasteful number, since it uses less digits than its factorization.
150905540983257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105322989 (or 105322983 counting only the distinct ones).
The product of its (nonzero) digits is 68040000, while the sum is 63.
The spelling of 150905540983257 in words is "one hundred fifty trillion, nine hundred five billion, five hundred forty million, nine hundred eighty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •