Base | Representation |
---|---|
bin | 1000101101000010… |
… | …00000100100011101 |
3 | 110001122112201121121 |
4 | 10112201000210131 |
5 | 34032204003013 |
6 | 2051400330541 |
7 | 223536312565 |
oct | 42641004435 |
9 | 13048481547 |
10 | 4672719133 |
11 | 1a886a0055 |
12 | aa4a73a51 |
13 | 5960cb684 |
14 | 324829da5 |
15 | 1c535958d |
hex | 11684091d |
4672719133 has 4 divisors (see below), whose sum is σ = 4749321148. Its totient is φ = 4596117120.
The previous prime is 4672719131. The next prime is 4672719137. The reversal of 4672719133 is 3319172764.
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 2317267044 + 2355452089 = 48138^2 + 48533^2 .
It is a cyclic number.
It is not a de Polignac number, because 4672719133 - 21 = 4672719131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4672719133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4672719131) 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, 38300916 + ... + 38301037.
It is an arithmetic number, because the mean of its divisors is an integer number (1187330287).
Almost surely, 24672719133 is an apocalyptic number.
It is an amenable number.
4672719133 is a deficient number, since it is larger than the sum of its proper divisors (76602015).
4672719133 is an equidigital number, since it uses as much as digits as its factorization.
4672719133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76602014.
The product of its digits is 190512, while the sum is 43.
The square root of 4672719133 is about 68357.2902695828. The cubic root of 4672719133 is about 1671.8214475748.
The spelling of 4672719133 in words is "four billion, six hundred seventy-two million, seven hundred nineteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •