Base | Representation |
---|---|
bin | 1010010001010101… |
… | …01011100010000001 |
3 | 112020021210002000221 |
4 | 11020222223202001 |
5 | 42243103141301 |
6 | 2311054343041 |
7 | 253434130420 |
oct | 51052534201 |
9 | 15207702027 |
10 | 5514115201 |
11 | 237a635401 |
12 | 109a7baa81 |
13 | 69b51667a |
14 | 3a448d2b7 |
15 | 22415bda1 |
hex | 148aab881 |
5514115201 has 4 divisors (see below), whose sum is σ = 6301845952. Its totient is φ = 4726384452.
The previous prime is 5514115163. The next prime is 5514115207. The reversal of 5514115201 is 1025114155.
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 5514115201 - 27 = 5514115073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5514115207) 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, 393865365 + ... + 393865378.
It is an arithmetic number, because the mean of its divisors is an integer number (1575461488).
Almost surely, 25514115201 is an apocalyptic number.
It is an amenable number.
5514115201 is a deficient number, since it is larger than the sum of its proper divisors (787730751).
5514115201 is an equidigital number, since it uses as much as digits as its factorization.
5514115201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787730750.
The product of its (nonzero) digits is 1000, while the sum is 25.
The square root of 5514115201 is about 74257.0885572549. The cubic root of 5514115201 is about 1766.6829254744.
Adding to 5514115201 its reverse (1025114155), we get a palindrome (6539229356).
The spelling of 5514115201 in words is "five billion, five hundred fourteen million, one hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •