Base | Representation |
---|---|
bin | 111100111111010… |
… | …110011101010111 |
3 | 2122022101222102122 |
4 | 330333112131113 |
5 | 4043422140043 |
6 | 245311330155 |
7 | 34233253031 |
oct | 7477263527 |
9 | 2568358378 |
10 | 1023240023 |
11 | 485657413 |
12 | 24682095b |
13 | 133cb6290 |
14 | 99c7ac51 |
15 | 5ec72368 |
hex | 3cfd6757 |
1023240023 has 8 divisors (see below), whose sum is σ = 1102200288. Its totient is φ = 944315424.
The previous prime is 1023240011. The next prime is 1023240061. The reversal of 1023240023 is 3200423201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023240023 - 210 = 1023238999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1023239983 and 1023240010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023240073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100265 + ... + 109997.
It is an arithmetic number, because the mean of its divisors is an integer number (137775036).
Almost surely, 21023240023 is an apocalyptic number.
1023240023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1023240023 is a deficient number, since it is larger than the sum of its proper divisors (78960265).
1023240023 is an equidigital number, since it uses as much as digits as its factorization.
1023240023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17833.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 1023240023 is about 31988.1231553213. The cubic root of 1023240023 is about 1007.6874263757.
Adding to 1023240023 its reverse (3200423201), we get a palindrome (4223663224).
The spelling of 1023240023 in words is "one billion, twenty-three million, two hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •