Base | Representation |
---|---|
bin | 1001110011011010… |
… | …10111001100111001 |
3 | 111120210120020101100 |
4 | 10321231113030321 |
5 | 41234332110441 |
6 | 2230131442013 |
7 | 244266060102 |
oct | 47155271471 |
9 | 14523506340 |
10 | 5263160121 |
11 | 2260a0a10a |
12 | 102a756309 |
13 | 65b52b33b |
14 | 37d0053a9 |
15 | 20c0d9cb6 |
hex | 139b57339 |
5263160121 has 6 divisors (see below), whose sum is σ = 7602342410. Its totient is φ = 3508773408.
The previous prime is 5263160107. The next prime is 5263160171. The reversal of 5263160121 is 1210613625.
5263160121 is a `hidden beast` number, since 5 + 2 + 6 + 31 + 601 + 21 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4637610000 + 625550121 = 68100^2 + 25011^2 .
It is not a de Polignac number, because 5263160121 - 26 = 5263160057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5263160171) 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 5 ways as a sum of consecutive naturals, for example, 292397776 + ... + 292397793.
Almost surely, 25263160121 is an apocalyptic number.
It is an amenable number.
5263160121 is a deficient number, since it is larger than the sum of its proper divisors (2339182289).
5263160121 is a wasteful number, since it uses less digits than its factorization.
5263160121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584795575 (or 584795572 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 5263160121 is about 72547.6403544595. The cubic root of 5263160121 is about 1739.4643307481.
Adding to 5263160121 its reverse (1210613625), we get a palindrome (6473773746).
The spelling of 5263160121 in words is "five billion, two hundred sixty-three million, one hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •