Base | Representation |
---|---|
bin | 1011000111111101… |
… | …11001100101100001 |
3 | 120102020010101020211 |
4 | 11203332321211201 |
5 | 44212413303411 |
6 | 2424345134121 |
7 | 301000365205 |
oct | 54376714541 |
9 | 16366111224 |
10 | 5972400481 |
11 | 259529a973 |
12 | 11a818a341 |
13 | 7424545a8 |
14 | 4092a6b05 |
15 | 24e4d5221 |
hex | 163fb9961 |
5972400481 has 2 divisors, whose sum is σ = 5972400482. Its totient is φ = 5972400480.
The previous prime is 5972400479. The next prime is 5972400517. The reversal of 5972400481 is 1840042795.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3920763456 + 2051637025 = 62616^2 + 45295^2 .
It is a cyclic number.
It is not a de Polignac number, because 5972400481 - 21 = 5972400479 is a prime.
It is a super-2 number, since 2×59724004812 = 71339135010898062722, which contains 22 as substring.
Together with 5972400479, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5972400881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2986200240 + 2986200241.
It is an arithmetic number, because the mean of its divisors is an integer number (2986200241).
Almost surely, 25972400481 is an apocalyptic number.
It is an amenable number.
5972400481 is a deficient number, since it is larger than the sum of its proper divisors (1).
5972400481 is an equidigital number, since it uses as much as digits as its factorization.
5972400481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 5972400481 is about 77281.3074488262. The cubic root of 5972400481 is about 1814.3301067595.
The spelling of 5972400481 in words is "five billion, nine hundred seventy-two million, four hundred thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •