Base | Representation |
---|---|
bin | 10000010110000101010… |
… | …000110010000000001101 |
3 | 10222101020021210102211012 |
4 | 100112011100302000031 |
5 | 121400324342424401 |
6 | 2220000130335005 |
7 | 144102331311023 |
oct | 20260520620015 |
9 | 3871207712735 |
10 | 1123222233101 |
11 | 3a33a0739481 |
12 | 161830a2a465 |
13 | 81bc4c073c7 |
14 | 3c5156c4713 |
15 | 1e33e55c8bb |
hex | 1058543200d |
1123222233101 has 8 divisors (see below), whose sum is σ = 1130799264000. Its totient is φ = 1115645717520.
The previous prime is 1123222233041. The next prime is 1123222233121. The reversal of 1123222233101 is 1013322223211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123222233101 - 226 = 1123155124237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123222233121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4906256 + ... + 5130086.
It is an arithmetic number, because the mean of its divisors is an integer number (141349908000).
Almost surely, 21123222233101 is an apocalyptic number.
It is an amenable number.
1123222233101 is a deficient number, since it is larger than the sum of its proper divisors (7577030899).
1123222233101 is a wasteful number, since it uses less digits than its factorization.
1123222233101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257659.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1123222233101 its reverse (1013322223211), we get a palindrome (2136544456312).
The spelling of 1123222233101 in words is "one trillion, one hundred twenty-three billion, two hundred twenty-two million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •