Base | Representation |
---|---|
bin | 111100111011011… |
… | …0110001110011111 |
3 | 12021110221100102011 |
4 | 1321312312032133 |
5 | 13141332433043 |
6 | 534511012051 |
7 | 101443202101 |
oct | 17166661637 |
9 | 5243840364 |
10 | 2044421023 |
11 | 95a027857 |
12 | 49080a027 |
13 | 26772b2a8 |
14 | 15573d571 |
15 | be73959d |
hex | 79db639f |
2044421023 has 4 divisors (see below), whose sum is σ = 2044524240. Its totient is φ = 2044317808.
The previous prime is 2044421021. The next prime is 2044421053. The reversal of 2044421023 is 3201244402.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2044421023 - 21 = 2044421021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2044420985 and 2044421003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2044421021) 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, 11515 + ... + 64972.
It is an arithmetic number, because the mean of its divisors is an integer number (511131060).
Almost surely, 22044421023 is an apocalyptic number.
2044421023 is a deficient number, since it is larger than the sum of its proper divisors (103217).
2044421023 is an equidigital number, since it uses as much as digits as its factorization.
2044421023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103216.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 2044421023 is about 45215.2742223245. The cubic root of 2044421023 is about 1269.1806613009.
Adding to 2044421023 its reverse (3201244402), we get a palindrome (5245665425).
The spelling of 2044421023 in words is "two billion, forty-four million, four hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •