Base | Representation |
---|---|
bin | 11000011010111000… |
… | …00010000011010011 |
3 | 1020211200102222212112 |
4 | 30031130002003103 |
5 | 203322222313011 |
6 | 10004532215535 |
7 | 642613112540 |
oct | 141534020323 |
9 | 36750388775 |
10 | 13110354131 |
11 | 56184a9116 |
12 | 265a76a5ab |
13 | 130c1cc2c4 |
14 | 8c5293bc7 |
15 | 51ae9e58b |
hex | 30d7020d3 |
13110354131 has 8 divisors (see below), whose sum is σ = 15634708224. Its totient is φ = 10748861640.
The previous prime is 13110354097. The next prime is 13110354157. The reversal of 13110354131 is 13145301131.
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 13110354131 - 230 = 12036612307 is a prime.
It is a super-2 number, since 2×131103541312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110354097 and 13110354106.
It is not an unprimeable number, because it can be changed into a prime (13110354161) 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, 40715225 + ... + 40715546.
It is an arithmetic number, because the mean of its divisors is an integer number (1954338528).
Almost surely, 213110354131 is an apocalyptic number.
13110354131 is a deficient number, since it is larger than the sum of its proper divisors (2524354093).
13110354131 is an equidigital number, since it uses as much as digits as its factorization.
13110354131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81430801.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 13110354131 its reverse (13145301131), we get a palindrome (26255655262).
The spelling of 13110354131 in words is "thirteen billion, one hundred ten million, three hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •