Base | Representation |
---|---|
bin | 10011000100001000110… |
… | …001000110000111001101 |
3 | 11122020121222002000121121 |
4 | 103010020301012013031 |
5 | 132431102200104401 |
6 | 2441505053200541 |
7 | 163436541135601 |
oct | 23041061060715 |
9 | 4566558060547 |
10 | 1310112113101 |
11 | 465685151460 |
12 | 191aa9a90151 |
13 | 9670a0a9a0c |
14 | 475a4573501 |
15 | 2412ba7bca1 |
hex | 13108c461cd |
1310112113101 has 8 divisors (see below), whose sum is σ = 1429899371424. Its totient is φ = 1190439214320.
The previous prime is 1310112113099. The next prime is 1310112113171. The reversal of 1310112113101 is 1013112110131.
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 1310112113101 - 21 = 1310112113099 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 (1310112113171) 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, 28565926 + ... + 28611751.
It is an arithmetic number, because the mean of its divisors is an integer number (178737421428).
Almost surely, 21310112113101 is an apocalyptic number.
1310112113101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1310112113101 is a deficient number, since it is larger than the sum of its proper divisors (119787258323).
1310112113101 is a wasteful number, since it uses less digits than its factorization.
1310112113101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57179771.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1310112113101 its reverse (1013112110131), we get a palindrome (2323224223232).
The spelling of 1310112113101 in words is "one trillion, three hundred ten billion, one hundred twelve million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •