Base | Representation |
---|---|
bin | 10000011101010110001… |
… | …011011010101000011101 |
3 | 11000010100212212102220202 |
4 | 100131112023122220131 |
5 | 122012313142411333 |
6 | 2223330123353245 |
7 | 144466533230615 |
oct | 20352613325035 |
9 | 4003325772822 |
10 | 1131022232093 |
11 | 3a6733623136 |
12 | 163249082825 |
13 | 82868b92920 |
14 | 3ca555a9a45 |
15 | 1e6491ed5e8 |
hex | 107562daa1d |
1131022232093 has 8 divisors (see below), whose sum is σ = 1219169793408. Its totient is φ = 1043038363824.
The previous prime is 1131022232057. The next prime is 1131022232099. The reversal of 1131022232093 is 3902322201311.
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 1131022232093 - 214 = 1131022215709 is a prime.
It is a super-2 number, since 2×11310222320932 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131022232099) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40908905 + ... + 40936542.
It is an arithmetic number, because the mean of its divisors is an integer number (152396224176).
Almost surely, 21131022232093 is an apocalyptic number.
1131022232093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1131022232093 is a deficient number, since it is larger than the sum of its proper divisors (88147561315).
1131022232093 is a wasteful number, since it uses less digits than its factorization.
1131022232093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81846523.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 1131022232093 in words is "one trillion, one hundred thirty-one billion, twenty-two million, two hundred thirty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •