Base | Representation |
---|---|
bin | 10110011111001101101111… |
… | …00100110111111001010011 |
3 | 20111002110202220000022200121 |
4 | 23033212313210313321103 |
5 | 22440201211311004012 |
6 | 253101254324331111 |
7 | 13262501554540516 |
oct | 1317466744677123 |
9 | 214073686008617 |
10 | 49451038375507 |
11 | 14836081a8251a |
12 | 5667b38843a97 |
13 | 217929c9ba982 |
14 | c2d62b950d7d |
15 | 5ab5058e8a07 |
hex | 2cf9b7937e53 |
49451038375507 has 2 divisors, whose sum is σ = 49451038375508. Its totient is φ = 49451038375506.
The previous prime is 49451038375499. The next prime is 49451038375513. The reversal of 49451038375507 is 70557383015494.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49451038375507 - 23 = 49451038375499 is a prime.
It is not a weakly prime, because it can be changed into another prime (49451038375597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24725519187753 + 24725519187754.
It is an arithmetic number, because the mean of its divisors is an integer number (24725519187754).
Almost surely, 249451038375507 is an apocalyptic number.
49451038375507 is a deficient number, since it is larger than the sum of its proper divisors (1).
49451038375507 is an equidigital number, since it uses as much as digits as its factorization.
49451038375507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504000, while the sum is 61.
The spelling of 49451038375507 in words is "forty-nine trillion, four hundred fifty-one billion, thirty-eight million, three hundred seventy-five thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •