Base | Representation |
---|---|
bin | 1011111011000111000101… |
… | …0000000101100111011110 |
3 | 1201102022120012202221012100 |
4 | 2332301301100011213132 |
5 | 3204244031344330420 |
6 | 43514414255545530 |
7 | 2522114332201110 |
oct | 276616120054736 |
9 | 51368505687170 |
10 | 13110140230110 |
11 | 41a4a85419860 |
12 | 15789bb52b2a6 |
13 | 741386243301 |
14 | 334769aad3b0 |
15 | 17b058c2e190 |
hex | bec714059de |
13110140230110 has 384 divisors, whose sum is σ = 42692821217280. Its totient is φ = 2711671603200.
The previous prime is 13110140230007. The next prime is 13110140230111. The reversal of 13110140230110 is 1103204101131.
It is a happy number.
13110140230110 is a `hidden beast` number, since 1 + 311 + 0 + 1 + 40 + 2 + 301 + 10 = 666.
It is a super-2 number, since 2×131101402301102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110140230111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 2245268571 + ... + 2245274409.
It is an arithmetic number, because the mean of its divisors is an integer number (111179221920).
Almost surely, 213110140230110 is an apocalyptic number.
13110140230110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13110140230110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21346410608640).
13110140230110 is an abundant number, since it is smaller than the sum of its proper divisors (29582680987170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110140230110 is a wasteful number, since it uses less digits than its factorization.
13110140230110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7304 (or 7301 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 13110140230110 its reverse (1103204101131), we get a palindrome (14213344331241).
The spelling of 13110140230110 in words is "thirteen trillion, one hundred ten billion, one hundred forty million, two hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •