Base | Representation |
---|---|
bin | 1010101111001100… |
… | …10101010001000101 |
3 | 112212202011201202201 |
4 | 11113212111101011 |
5 | 43301221234134 |
6 | 2352004034501 |
7 | 262565402104 |
oct | 52746252105 |
9 | 15782151681 |
10 | 5764633669 |
11 | 2498a92663 |
12 | 114a692a31 |
13 | 70b3ab052 |
14 | 3c986203b |
15 | 23b144914 |
hex | 157995445 |
5764633669 has 4 divisors (see below), whose sum is σ = 5873400396. Its totient is φ = 5655866944.
The previous prime is 5764633663. The next prime is 5764633673. The reversal of 5764633669 is 9663364675.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4773013569 + 991620100 = 69087^2 + 31490^2 .
It is a cyclic number.
It is not a de Polignac number, because 5764633669 - 27 = 5764633541 is a prime.
It is a super-2 number, since 2×57646336692 = 66462002675536803122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5764633663) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54383284 + ... + 54383389.
It is an arithmetic number, because the mean of its divisors is an integer number (1468350099).
Almost surely, 25764633669 is an apocalyptic number.
It is an amenable number.
5764633669 is a deficient number, since it is larger than the sum of its proper divisors (108766727).
5764633669 is a wasteful number, since it uses less digits than its factorization.
5764633669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108766726.
The product of its digits is 14696640, while the sum is 55.
The square root of 5764633669 is about 75925.1846820276. The cubic root of 5764633669 is about 1793.0424490966.
The spelling of 5764633669 in words is "five billion, seven hundred sixty-four million, six hundred thirty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •