Base | Representation |
---|---|
bin | 11001001111010001110000… |
… | …011011010111101101010101 |
3 | 112120000121001000012110010012 |
4 | 121033101300123113231111 |
5 | 104022120042340133023 |
6 | 1032025055354210005 |
7 | 32244362531020334 |
oct | 3117216033275525 |
9 | 476017030173105 |
10 | 111001021021013 |
11 | 324062a5637302 |
12 | 105488a9423905 |
13 | 49c2474c57236 |
14 | 1d5a699c07d1b |
15 | cc75d090d978 |
hex | 64f4706d7b55 |
111001021021013 has 4 divisors (see below), whose sum is σ = 111005235369120. Its totient is φ = 110996806672908.
The previous prime is 111001021020959. The next prime is 111001021021021. The reversal of 111001021021013 is 310120120100111.
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 111001021021013 - 246 = 40632276843349 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 (111001021021063) 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, 2107134545 + ... + 2107187222.
It is an arithmetic number, because the mean of its divisors is an integer number (27751308842280).
Almost surely, 2111001021021013 is an apocalyptic number.
It is an amenable number.
111001021021013 is a deficient number, since it is larger than the sum of its proper divisors (4214348107).
111001021021013 is an equidigital number, since it uses as much as digits as its factorization.
111001021021013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4214348106.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111001021021013 its reverse (310120120100111), we get a palindrome (421121141121124).
The spelling of 111001021021013 in words is "one hundred eleven trillion, one billion, twenty-one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •