Base | Representation |
---|---|
bin | 1010100100100110… |
… | …00101101011111001 |
3 | 112122112211120212110 |
4 | 11102103011223321 |
5 | 43110434444113 |
6 | 2335110002533 |
7 | 260435452110 |
oct | 52223055371 |
9 | 15575746773 |
10 | 5675703033 |
11 | 2452871770 |
12 | 1124946449 |
13 | 6c5b41a80 |
14 | 3bbb12c77 |
15 | 233429bc3 |
hex | 1524c5af9 |
5675703033 has 64 divisors (see below), whose sum is σ = 10377142272. Its totient is φ = 2663642880.
The previous prime is 5675702969. The next prime is 5675703041. The reversal of 5675703033 is 3303075765.
It is not a de Polignac number, because 5675703033 - 26 = 5675702969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 5675702982 and 5675703000.
It is not an unprimeable number, because it can be changed into a prime (5675703043) 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 in 63 ways as a sum of consecutive naturals, for example, 121035 + ... + 161247.
It is an arithmetic number, because the mean of its divisors is an integer number (162142848).
Almost surely, 25675703033 is an apocalyptic number.
It is an amenable number.
5675703033 is a deficient number, since it is larger than the sum of its proper divisors (4701439239).
5675703033 is a wasteful number, since it uses less digits than its factorization.
5675703033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40294.
The product of its (nonzero) digits is 198450, while the sum is 39.
The square root of 5675703033 is about 75337.2619160001. The cubic root of 5675703033 is about 1783.7742405750.
Adding to 5675703033 its reverse (3303075765), we get a palindrome (8978778798).
The spelling of 5675703033 in words is "five billion, six hundred seventy-five million, seven hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •