Base | Representation |
---|---|
bin | 1010000111100010… |
… | …11101000111011001 |
3 | 112000120021110010101 |
4 | 11003301131013121 |
5 | 42111043130311 |
6 | 2255002415401 |
7 | 251416165336 |
oct | 50361350731 |
9 | 15016243111 |
10 | 5432005081 |
11 | 23382528a8 |
12 | 1077201561 |
13 | 6874c79b9 |
14 | 3975d798d |
15 | 21bd3cec1 |
hex | 143c5d1d9 |
5432005081 has 6 divisors (see below), whose sum is σ = 5482309182. Its totient is φ = 5382158400.
The previous prime is 5432005079. The next prime is 5432005127. The reversal of 5432005081 is 1805002345.
It can be written as a sum of positive squares in 3 ways, for example, as 3674299456 + 1757705625 = 60616^2 + 41925^2 .
It is not a de Polignac number, because 5432005081 - 21 = 5432005079 is a prime.
It is a super-2 number, since 2×54320050812 = 59013358400019633122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5432005001) 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 in 5 ways as a sum of consecutive naturals, for example, 216720 + ... + 240481.
It is an arithmetic number, because the mean of its divisors is an integer number (913718197).
Almost surely, 25432005081 is an apocalyptic number.
It is an amenable number.
5432005081 is a deficient number, since it is larger than the sum of its proper divisors (50304101).
5432005081 is an equidigital number, since it uses as much as digits as its factorization.
5432005081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457419 (or 457310 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 5432005081 is about 73702.1375605891. The cubic root of 5432005081 is about 1757.8698705365.
The spelling of 5432005081 in words is "five billion, four hundred thirty-two million, five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •