Base | Representation |
---|---|
bin | 10000000001011001100… |
… | …000001000011011001001 |
3 | 10220020220111121211112201 |
4 | 100001121200020123021 |
5 | 121014333341114423 |
6 | 2201444250240201 |
7 | 142355063660536 |
oct | 20013140103311 |
9 | 3806814554481 |
10 | 1101013223113 |
11 | 394a34296571 |
12 | 159473126061 |
13 | 7ca9599508b |
14 | 3b409c97d8d |
15 | 1d98e8e52ad |
hex | 100598086c9 |
1101013223113 has 4 divisors (see below), whose sum is σ = 1101016066320. Its totient is φ = 1101010379908.
The previous prime is 1101013223083. The next prime is 1101013223117. The reversal of 1101013223113 is 3113223101011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1101013223113 - 221 = 1101011125961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101013223117) 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 3 ways as a sum of consecutive naturals, for example, 727903 + ... + 1652836.
It is an arithmetic number, because the mean of its divisors is an integer number (275254016580).
Almost surely, 21101013223113 is an apocalyptic number.
It is an amenable number.
1101013223113 is a deficient number, since it is larger than the sum of its proper divisors (2843207).
1101013223113 is an equidigital number, since it uses as much as digits as its factorization.
1101013223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2843206.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1101013223113 its reverse (3113223101011), we get a palindrome (4214236324124).
The spelling of 1101013223113 in words is "one trillion, one hundred one billion, thirteen million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •