Base | Representation |
---|---|
bin | 1010100011011000… |
… | …01010110100010001 |
3 | 112121211122020112101 |
4 | 11101230022310101 |
5 | 43100332003213 |
6 | 2334103200401 |
7 | 260252646655 |
oct | 52154126421 |
9 | 15554566471 |
10 | 5665500433 |
11 | 244803336a |
12 | 1121446101 |
13 | 6c39abc28 |
14 | 3ba618a65 |
15 | 2325b1bdd |
hex | 151b0ad11 |
5665500433 has 4 divisors (see below), whose sum is σ = 5665701888. Its totient is φ = 5665298980.
The previous prime is 5665500431. The next prime is 5665500439. The reversal of 5665500433 is 3340055665.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3340055665 = 5 ⋅668011133.
It is a cyclic number.
It is not a de Polignac number, because 5665500433 - 21 = 5665500431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5665500392 and 5665500401.
It is not an unprimeable number, because it can be changed into a prime (5665500431) 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, 50041 + ... + 117622.
It is an arithmetic number, because the mean of its divisors is an integer number (1416425472).
Almost surely, 25665500433 is an apocalyptic number.
It is an amenable number.
5665500433 is a deficient number, since it is larger than the sum of its proper divisors (201455).
5665500433 is a wasteful number, since it uses less digits than its factorization.
5665500433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201454.
The product of its (nonzero) digits is 162000, while the sum is 37.
The square root of 5665500433 is about 75269.5186180967. The cubic root of 5665500433 is about 1782.7047665534.
The spelling of 5665500433 in words is "five billion, six hundred sixty-five million, five hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •