Base | Representation |
---|---|
bin | 100111011100001… |
… | …1100100101110111 |
3 | 10102020020200222102 |
4 | 1032320130211313 |
5 | 10202243420043 |
6 | 335153252315 |
7 | 44536612262 |
oct | 11670344567 |
9 | 3366220872 |
10 | 1323420023 |
11 | 61a044062 |
12 | 30b26409b |
13 | 181247c93 |
14 | c7a99cd9 |
15 | 7b2b96b8 |
hex | 4ee1c977 |
1323420023 has 4 divisors (see below), whose sum is σ = 1380960048. Its totient is φ = 1265880000.
The previous prime is 1323420011. The next prime is 1323420047. The reversal of 1323420023 is 3200243231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3200243231 = 48187 ⋅66413.
It is a cyclic number.
It is not a de Polignac number, because 1323420023 - 28 = 1323419767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1323419977 and 1323420004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323420823) 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, 28769978 + ... + 28770023.
It is an arithmetic number, because the mean of its divisors is an integer number (345240012).
Almost surely, 21323420023 is an apocalyptic number.
1323420023 is a deficient number, since it is larger than the sum of its proper divisors (57540025).
1323420023 is an equidigital number, since it uses as much as digits as its factorization.
1323420023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57540024.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 1323420023 is about 36378.8403196144. The cubic root of 1323420023 is about 1097.9078755116.
Adding to 1323420023 its reverse (3200243231), we get a palindrome (4523663254).
The spelling of 1323420023 in words is "one billion, three hundred twenty-three million, four hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •