Base | Representation |
---|---|
bin | 10000010110101001000… |
… | …100111010100101000001 |
3 | 10222102210011102202100222 |
4 | 100112221010322211001 |
5 | 121403042203233043 |
6 | 2220135513152425 |
7 | 144123245520134 |
oct | 20265104724501 |
9 | 3872704382328 |
10 | 1123823102273 |
11 | 3a3679930373 |
12 | 16197a0bb715 |
13 | 81c8c5487b1 |
14 | 3c57141621b |
15 | 1e37719cd68 |
hex | 105a913a941 |
1123823102273 has 4 divisors (see below), whose sum is σ = 1123875179220. Its totient is φ = 1123771025328.
The previous prime is 1123823102267. The next prime is 1123823102293. The reversal of 1123823102273 is 3722013283211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 550581808144 + 573241294129 = 742012^2 + 757127^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123823102273 - 240 = 24311474497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1123823102293) 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, 26006090 + ... + 26049267.
It is an arithmetic number, because the mean of its divisors is an integer number (280968794805).
Almost surely, 21123823102273 is an apocalyptic number.
It is an amenable number.
1123823102273 is a deficient number, since it is larger than the sum of its proper divisors (52076947).
1123823102273 is an equidigital number, since it uses as much as digits as its factorization.
1123823102273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52076946.
The product of its (nonzero) digits is 24192, while the sum is 35.
Adding to 1123823102273 its reverse (3722013283211), we get a palindrome (4845836385484).
The spelling of 1123823102273 in words is "one trillion, one hundred twenty-three billion, eight hundred twenty-three million, one hundred two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •