Base | Representation |
---|---|
bin | 1111001101000111… |
… | …0001010011100101 |
3 | 101112110002210110112 |
4 | 3303101301103211 |
5 | 31324332200033 |
6 | 1513001102405 |
7 | 203100235511 |
oct | 36321612345 |
9 | 11473083415 |
10 | 4081521893 |
11 | 1804a04899 |
12 | 95aa87a05 |
13 | 500795717 |
14 | 2aa0d5141 |
15 | 18d4c9c48 |
hex | f34714e5 |
4081521893 has 2 divisors, whose sum is σ = 4081521894. Its totient is φ = 4081521892.
The previous prime is 4081521889. The next prime is 4081521901. The reversal of 4081521893 is 3981251804.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2633947684 + 1447574209 = 51322^2 + 38047^2 .
It is a cyclic number.
It is not a de Polignac number, because 4081521893 - 22 = 4081521889 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4081521893.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4081521853) 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 as a sum of consecutive naturals, namely, 2040760946 + 2040760947.
It is an arithmetic number, because the mean of its divisors is an integer number (2040760947).
Almost surely, 24081521893 is an apocalyptic number.
It is an amenable number.
4081521893 is a deficient number, since it is larger than the sum of its proper divisors (1).
4081521893 is an equidigital number, since it uses as much as digits as its factorization.
4081521893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 41.
The square root of 4081521893 is about 63886.7896595219. The cubic root of 4081521893 is about 1598.1126042790.
The spelling of 4081521893 in words is "four billion, eighty-one million, five hundred twenty-one thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.076 sec. • engine limits •