Base | Representation |
---|---|
bin | 11001001111010010111000… |
… | …100011000111111100001011 |
3 | 112120000201011100000102021002 |
4 | 121033102320203013330023 |
5 | 104022130032114410011 |
6 | 1032025415420405215 |
7 | 32244434522543213 |
oct | 3117227043077413 |
9 | 476021140012232 |
10 | 111002231013131 |
11 | 32406866648297 |
12 | 10548b866a680b |
13 | 49c26088397c3 |
14 | 1d5a7727b9243 |
15 | cc7651c6ec3b |
hex | 64f4b88c7f0b |
111002231013131 has 4 divisors (see below), whose sum is σ = 111320288982000. Its totient is φ = 110684173044264.
The previous prime is 111002231013127. The next prime is 111002231013217. The reversal of 111002231013131 is 131310132200111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111002231013131 - 22 = 111002231013127 is a prime.
It is a super-2 number, since 2×1110022310131312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111002231019131) 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, 159028983911 + ... + 159028984608.
It is an arithmetic number, because the mean of its divisors is an integer number (27830072245500).
Almost surely, 2111002231013131 is an apocalyptic number.
111002231013131 is a deficient number, since it is larger than the sum of its proper divisors (318057968869).
111002231013131 is an equidigital number, since it uses as much as digits as its factorization.
111002231013131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318057968868.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 111002231013131 its reverse (131310132200111), we get a palindrome (242312363213242).
The spelling of 111002231013131 in words is "one hundred eleven trillion, two billion, two hundred thirty-one million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •