Base | Representation |
---|---|
bin | 1000101001001001… |
… | …0000111111110111 |
3 | 12222200120110002102 |
4 | 2022102100333313 |
5 | 14222412402043 |
6 | 1022114332315 |
7 | 111331022513 |
oct | 21222207767 |
9 | 5880513072 |
10 | 2320044023 |
11 | a90671460 |
12 | 548b8a09b |
13 | 2ac87261b |
14 | 1801a9143 |
15 | d8a306b8 |
hex | 8a490ff7 |
2320044023 has 8 divisors (see below), whose sum is σ = 2534336256. Its totient is φ = 2106315000.
The previous prime is 2320044011. The next prime is 2320044029. The reversal of 2320044023 is 3204400232.
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 2320044023 - 28 = 2320043767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2320043986 and 2320044004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320044029) 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 7 ways as a sum of consecutive naturals, for example, 132161 + ... + 148682.
It is an arithmetic number, because the mean of its divisors is an integer number (316792032).
Almost surely, 22320044023 is an apocalyptic number.
2320044023 is a deficient number, since it is larger than the sum of its proper divisors (214292233).
2320044023 is a wasteful number, since it uses less digits than its factorization.
2320044023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281605.
The product of its (nonzero) digits is 1152, while the sum is 20.
The square root of 2320044023 is about 48166.8353018963. The cubic root of 2320044023 is about 1323.8295629115.
Adding to 2320044023 its reverse (3204400232), we get a palindrome (5524444255).
The spelling of 2320044023 in words is "two billion, three hundred twenty million, forty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •