Base | Representation |
---|---|
bin | 1111101001100100100001 |
3 | 21201102110222 |
4 | 33221210201 |
5 | 2022234213 |
6 | 223532425 |
7 | 46604306 |
oct | 17514441 |
9 | 7642428 |
10 | 4102433 |
11 | 2352245 |
12 | 145a115 |
13 | b0839a |
14 | 78b0ad |
15 | 560808 |
hex | 3e9921 |
4102433 has 8 divisors (see below), whose sum is σ = 4214760. Its totient is φ = 3991680.
The previous prime is 4102409. The next prime is 4102453. The reversal of 4102433 is 3342014.
4102433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 54289 + 4048144 = 233^2 + 2012^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4102433 - 212 = 4098337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4102453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6341 + ... + 6957.
It is an arithmetic number, because the mean of its divisors is an integer number (526845).
Almost surely, 24102433 is an apocalyptic number.
It is an amenable number.
4102433 is a deficient number, since it is larger than the sum of its proper divisors (112327).
4102433 is a wasteful number, since it uses less digits than its factorization.
4102433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 4102433 is about 2025.4463705564. The cubic root of 4102433 is about 160.0837192075.
Adding to 4102433 its reverse (3342014), we get a palindrome (7444447).
The spelling of 4102433 in words is "four million, one hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •