Base | Representation |
---|---|
bin | 1001100101001000… |
… | …00011111100111101 |
3 | 111021102222202210021 |
4 | 10302210003330331 |
5 | 41013140001334 |
6 | 2210210212141 |
7 | 241312112464 |
oct | 46244037475 |
9 | 14242882707 |
10 | 5143281469 |
11 | 21aa280547 |
12 | bb6584051 |
13 | 63c747721 |
14 | 36b11b9db |
15 | 20180a3b4 |
hex | 132903f3d |
5143281469 has 2 divisors, whose sum is σ = 5143281470. Its totient is φ = 5143281468.
The previous prime is 5143281467. The next prime is 5143281527. The reversal of 5143281469 is 9641823415.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5136588900 + 6692569 = 71670^2 + 2587^2 .
It is a cyclic number.
It is not a de Polignac number, because 5143281469 - 21 = 5143281467 is a prime.
It is a super-2 number, since 2×51432814692 = 52906688538717595922, which contains 22 as substring.
Together with 5143281467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5143281461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2571640734 + 2571640735.
It is an arithmetic number, because the mean of its divisors is an integer number (2571640735).
Almost surely, 25143281469 is an apocalyptic number.
It is an amenable number.
5143281469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5143281469 is an equidigital number, since it uses as much as digits as its factorization.
5143281469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 207360, while the sum is 43.
The square root of 5143281469 is about 71716.6749717247. The cubic root of 5143281469 is about 1726.1562192024.
The spelling of 5143281469 in words is "five billion, one hundred forty-three million, two hundred eighty-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •