Base | Representation |
---|---|
bin | 1010011111011001… |
… | …00101111111000001 |
3 | 112112111201011011010 |
4 | 11033230211333001 |
5 | 43013301313111 |
6 | 2330510311133 |
7 | 256365461034 |
oct | 51754457701 |
9 | 15474634133 |
10 | 5632057281 |
11 | 2430170aa4 |
12 | 11121b84a9 |
13 | 6b9a9c996 |
14 | 3b5dd101b |
15 | 22e6a7aa6 |
hex | 14fb25fc1 |
5632057281 has 4 divisors (see below), whose sum is σ = 7509409712. Its totient is φ = 3754704852.
The previous prime is 5632057261. The next prime is 5632057283. The reversal of 5632057281 is 1827502365.
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 5632057281 - 210 = 5632056257 is a prime.
It is a super-2 number, since 2×56320572812 = 63440138432930225922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5632057283) 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 in 3 ways as a sum of consecutive naturals, for example, 938676211 + ... + 938676216.
It is an arithmetic number, because the mean of its divisors is an integer number (1877352428).
Almost surely, 25632057281 is an apocalyptic number.
It is an amenable number.
5632057281 is a deficient number, since it is larger than the sum of its proper divisors (1877352431).
5632057281 is a wasteful number, since it uses less digits than its factorization.
5632057281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1877352430.
The product of its (nonzero) digits is 100800, while the sum is 39.
The square root of 5632057281 is about 75047.0337921493. The cubic root of 5632057281 is about 1779.1901042439.
The spelling of 5632057281 in words is "five billion, six hundred thirty-two million, fifty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •