Base | Representation |
---|---|
bin | 100100011100111… |
… | …0101100001111111 |
3 | 10011020111222121122 |
4 | 1020321311201333 |
5 | 10001104333043 |
6 | 321211421155 |
7 | 42211233335 |
oct | 11071654177 |
9 | 3136458548 |
10 | 1223121023 |
11 | 578468a23 |
12 | 2a17547bb |
13 | 16652b367 |
14 | b862bb55 |
15 | 725a6368 |
hex | 48e7587f |
1223121023 has 4 divisors (see below), whose sum is σ = 1265297640. Its totient is φ = 1180944408.
The previous prime is 1223121019. The next prime is 1223121043. The reversal of 1223121023 is 3201213221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3201213221 = 193 ⋅16586597.
It is a cyclic number.
It is not a de Polignac number, because 1223121023 - 22 = 1223121019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1223120992 and 1223121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223121013) 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, 21088265 + ... + 21088322.
It is an arithmetic number, because the mean of its divisors is an integer number (316324410).
Almost surely, 21223121023 is an apocalyptic number.
1223121023 is a deficient number, since it is larger than the sum of its proper divisors (42176617).
1223121023 is an equidigital number, since it uses as much as digits as its factorization.
1223121023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42176616.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1223121023 is about 34973.1471703649. The cubic root of 1223121023 is about 1069.4401307216.
Adding to 1223121023 its reverse (3201213221), we get a palindrome (4424334244).
The spelling of 1223121023 in words is "one billion, two hundred twenty-three million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •