Base | Representation |
---|---|
bin | 1110001010010000… |
… | …0110111110011001 |
3 | 100210220110201200011 |
4 | 3202210012332121 |
5 | 30241041212234 |
6 | 1425103041521 |
7 | 163123646335 |
oct | 34244067631 |
9 | 10726421604 |
10 | 3801116569 |
11 | 16806a4158 |
12 | 8a0ba02a1 |
13 | 487668703 |
14 | 280b827c5 |
15 | 173a8bb64 |
hex | e2906f99 |
3801116569 has 2 divisors, whose sum is σ = 3801116570. Its totient is φ = 3801116568.
The previous prime is 3801116549. The next prime is 3801116629. The reversal of 3801116569 is 9656111083.
3801116569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2094435225 + 1706681344 = 45765^2 + 41312^2 .
It is a cyclic number.
It is not a de Polignac number, because 3801116569 - 225 = 3767562137 is a prime.
It is a super-4 number, since 4×38011165694 (a number of 39 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (3801116549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1900558284 + 1900558285.
It is an arithmetic number, because the mean of its divisors is an integer number (1900558285).
Almost surely, 23801116569 is an apocalyptic number.
It is an amenable number.
3801116569 is a deficient number, since it is larger than the sum of its proper divisors (1).
3801116569 is an equidigital number, since it uses as much as digits as its factorization.
3801116569 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 40.
The square root of 3801116569 is about 61653.1959350041. The cubic root of 3801116569 is about 1560.6435774593.
The spelling of 3801116569 in words is "three billion, eight hundred one million, one hundred sixteen thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •