Base | Representation |
---|---|
bin | 100000110100001… |
… | …1100111010010111 |
3 | 2211201221212002121 |
4 | 1001220130322113 |
5 | 4223341420343 |
6 | 301132520411 |
7 | 36200251534 |
oct | 10150347227 |
9 | 2751855077 |
10 | 1101123223 |
11 | 5156121a2 |
12 | 268920107 |
13 | 147185005 |
14 | a6351d8b |
15 | 66a08aed |
hex | 41a1ce97 |
1101123223 has 4 divisors (see below), whose sum is σ = 1101590008. Its totient is φ = 1100656440.
The previous prime is 1101123187. The next prime is 1101123227. The reversal of 1101123223 is 3223211011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3223211011 = 1013 ⋅3181847.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101123223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101123197 and 1101123206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101123227) 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, 229836 + ... + 234577.
It is an arithmetic number, because the mean of its divisors is an integer number (275397502).
Almost surely, 21101123223 is an apocalyptic number.
1101123223 is a deficient number, since it is larger than the sum of its proper divisors (466785).
1101123223 is an equidigital number, since it uses as much as digits as its factorization.
1101123223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466784.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1101123223 is about 33183.1768069303. The cubic root of 1101123223 is about 1032.6313537408.
Adding to 1101123223 its reverse (3223211011), we get a palindrome (4324334234).
The spelling of 1101123223 in words is "one billion, one hundred one million, one hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •