Base | Representation |
---|---|
bin | 1010010001100100… |
… | …10000011101010001 |
3 | 112020102111222122222 |
4 | 11020302100131101 |
5 | 42244110221312 |
6 | 2311205110425 |
7 | 253460042306 |
oct | 51062203521 |
9 | 15212458588 |
10 | 5516101457 |
11 | 2380771739 |
12 | 109b3b8415 |
13 | 69ba60779 |
14 | 3a48490ad |
15 | 224400672 |
hex | 148c90751 |
5516101457 has 4 divisors (see below), whose sum is σ = 5518635120. Its totient is φ = 5513567796.
The previous prime is 5516101387. The next prime is 5516101483. The reversal of 5516101457 is 7541016155.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7541016155 = 5 ⋅1508203231.
It is a cyclic number.
It is not a de Polignac number, because 5516101457 - 218 = 5515839313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5516101957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1263563 + ... + 1267920.
It is an arithmetic number, because the mean of its divisors is an integer number (1379658780).
Almost surely, 25516101457 is an apocalyptic number.
It is an amenable number.
5516101457 is a deficient number, since it is larger than the sum of its proper divisors (2533663).
5516101457 is a wasteful number, since it uses less digits than its factorization.
5516101457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2533662.
The product of its (nonzero) digits is 21000, while the sum is 35.
The square root of 5516101457 is about 74270.4615375453. The cubic root of 5516101457 is about 1766.8950273969.
The spelling of 5516101457 in words is "five billion, five hundred sixteen million, one hundred one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •