Base | Representation |
---|---|
bin | 1011000111101001… |
… | …11001001101001001 |
3 | 120102001012010011200 |
4 | 11203310321031021 |
5 | 44211230334411 |
6 | 2424213014413 |
7 | 300636162033 |
oct | 54364711511 |
9 | 16361163150 |
10 | 5969777481 |
11 | 25938691a8 |
12 | 11a7324409 |
13 | 741a46715 |
14 | 408bc2c53 |
15 | 24e167e56 |
hex | 163d39349 |
5969777481 has 12 divisors (see below), whose sum is σ = 8624295108. Its totient is φ = 3979259424.
The previous prime is 5969777467. The next prime is 5969777533. The reversal of 5969777481 is 1847779695.
It can be written as a sum of positive squares in 2 ways, for example, as 3123021456 + 2846756025 = 55884^2 + 53355^2 .
It is not a de Polignac number, because 5969777481 - 25 = 5969777449 is a prime.
It is a super-2 number, since 2×59697774812 = 71276486345309410722, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5969777441) 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 11 ways as a sum of consecutive naturals, for example, 19551 + ... + 111003.
It is an arithmetic number, because the mean of its divisors is an integer number (718691259).
Almost surely, 25969777481 is an apocalyptic number.
It is an amenable number.
5969777481 is a deficient number, since it is larger than the sum of its proper divisors (2654517627).
5969777481 is a wasteful number, since it uses less digits than its factorization.
5969777481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98712 (or 98709 counting only the distinct ones).
The product of its digits is 26671680, while the sum is 63.
The square root of 5969777481 is about 77264.3351165336. The cubic root of 5969777481 is about 1814.0644578661.
The spelling of 5969777481 in words is "five billion, nine hundred sixty-nine million, seven hundred seventy-seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •