Base | Representation |
---|---|
bin | 111110100110010… |
… | …0011010101000001 |
3 | 12102101100112100012 |
4 | 1331030203111001 |
5 | 13300203124213 |
6 | 544231434305 |
7 | 103023315605 |
oct | 17514432501 |
9 | 5371315305 |
10 | 2100442433 |
11 | 988710541 |
12 | 4a7525995 |
13 | 27621435b |
14 | 15cd63505 |
15 | c46034a8 |
hex | 7d323541 |
2100442433 has 4 divisors (see below), whose sum is σ = 2100588720. Its totient is φ = 2100296148.
The previous prime is 2100442427. The next prime is 2100442493. The reversal of 2100442433 is 3342440012.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2100442433 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2100442399 and 2100442408.
It is not an unprimeable number, because it can be changed into a prime (2100442403) 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, 48935 + ... + 81212.
It is an arithmetic number, because the mean of its divisors is an integer number (525147180).
Almost surely, 22100442433 is an apocalyptic number.
It is an amenable number.
2100442433 is a deficient number, since it is larger than the sum of its proper divisors (146287).
2100442433 is a wasteful number, since it uses less digits than its factorization.
2100442433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146286.
The product of its (nonzero) digits is 2304, while the sum is 23.
The square root of 2100442433 is about 45830.5840351179. The cubic root of 2100442433 is about 1280.6690904950.
Adding to 2100442433 its reverse (3342440012), we get a palindrome (5442882445).
The spelling of 2100442433 in words is "two billion, one hundred million, four hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •