Base | Representation |
---|---|
bin | 1000110100010101… |
… | …11011110110101001 |
3 | 110012220221020002212 |
4 | 10122022323312221 |
5 | 34143403312023 |
6 | 2101430534505 |
7 | 225212455205 |
oct | 43212736651 |
9 | 13186836085 |
10 | 4734041513 |
11 | 200a274503 |
12 | b01507435 |
13 | 5a5a1c4c6 |
14 | 32ca2db05 |
15 | 1ca91de78 |
hex | 11a2bbda9 |
4734041513 has 2 divisors, whose sum is σ = 4734041514. Its totient is φ = 4734041512.
The previous prime is 4734041497. The next prime is 4734041593. The reversal of 4734041513 is 3151404374.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3548823184 + 1185218329 = 59572^2 + 34427^2 .
It is a cyclic number.
It is not a de Polignac number, because 4734041513 - 24 = 4734041497 is a prime.
It is a super-2 number, since 2×47340415132 = 44822298093614658338, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4734041513.
It is not a weakly prime, because it can be changed into another prime (4734041593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2367020756 + 2367020757.
It is an arithmetic number, because the mean of its divisors is an integer number (2367020757).
Almost surely, 24734041513 is an apocalyptic number.
It is an amenable number.
4734041513 is a deficient number, since it is larger than the sum of its proper divisors (1).
4734041513 is an equidigital number, since it uses as much as digits as its factorization.
4734041513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 4734041513 is about 68804.3713218862. The cubic root of 4734041513 is about 1679.1030634763.
Adding to 4734041513 its reverse (3151404374), we get a palindrome (7885445887).
The spelling of 4734041513 in words is "four billion, seven hundred thirty-four million, forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •