Base | Representation |
---|---|
bin | 1001100101000111… |
… | …10010110111011001 |
3 | 111021102212012210010 |
4 | 10302203302313121 |
5 | 41013130231411 |
6 | 2210204512133 |
7 | 241311401442 |
oct | 46243626731 |
9 | 14242765703 |
10 | 5143211481 |
11 | 21aa232a01 |
12 | bb654b649 |
13 | 63c721905 |
14 | 36b1002c9 |
15 | 2017e47a6 |
hex | 1328f2dd9 |
5143211481 has 4 divisors (see below), whose sum is σ = 6857615312. Its totient is φ = 3428807652.
The previous prime is 5143211461. The next prime is 5143211527. The reversal of 5143211481 is 1841123415.
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 not a de Polignac number, because 5143211481 - 26 = 5143211417 is a prime.
It is a super-2 number, since 2×51432114812 = 52905248676580426722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5143211461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 857201911 + ... + 857201916.
It is an arithmetic number, because the mean of its divisors is an integer number (1714403828).
Almost surely, 25143211481 is an apocalyptic number.
It is an amenable number.
5143211481 is a deficient number, since it is larger than the sum of its proper divisors (1714403831).
5143211481 is a wasteful number, since it uses less digits than its factorization.
5143211481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1714403830.
The product of its digits is 3840, while the sum is 30.
The square root of 5143211481 is about 71716.1870221779. The cubic root of 5143211481 is about 1726.1483895208.
Adding to 5143211481 its reverse (1841123415), we get a palindrome (6984334896).
The spelling of 5143211481 in words is "five billion, one hundred forty-three million, two hundred eleven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •