Base | Representation |
---|---|
bin | 100100101101010001100… |
… | …0011101011100010001001 |
3 | 122212022002121211202022021 |
4 | 1021122203003223202021 |
5 | 1130124203434201312 |
6 | 14421353054524441 |
7 | 1030330323061246 |
oct | 111324303534211 |
9 | 18768077752267 |
10 | 5045027256457 |
11 | 16756473a9801 |
12 | 695915506721 |
13 | 2a7989829696 |
14 | 1362758ac5cd |
15 | 8b375745c07 |
hex | 496a30eb889 |
5045027256457 has 4 divisors (see below), whose sum is σ = 5053862681296. Its totient is φ = 5036191831620.
The previous prime is 5045027256433. The next prime is 5045027256487. The reversal of 5045027256457 is 7546527205405.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5045027256457 - 215 = 5045027223689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5045027256487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4417711563 + ... + 4417712704.
It is an arithmetic number, because the mean of its divisors is an integer number (1263465670324).
Almost surely, 25045027256457 is an apocalyptic number.
It is an amenable number.
5045027256457 is a deficient number, since it is larger than the sum of its proper divisors (8835424839).
5045027256457 is an equidigital number, since it uses as much as digits as its factorization.
5045027256457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8835424838.
The product of its (nonzero) digits is 11760000, while the sum is 52.
The spelling of 5045027256457 in words is "five trillion, forty-five billion, twenty-seven million, two hundred fifty-six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •