Base | Representation |
---|---|
bin | 1011111011001110011000… |
… | …1000111111010000010001 |
3 | 1201102111121212212202220012 |
4 | 2332303212020333100101 |
5 | 3204312040413201223 |
6 | 43515341032324305 |
7 | 2522214044064515 |
oct | 276634610772021 |
9 | 51374555782805 |
10 | 13112101303313 |
11 | 41a58a1399111 |
12 | 1579268243695 |
13 | 74160960b45c |
14 | 3348b4314145 |
15 | 17b120ea2c78 |
hex | bece623f411 |
13112101303313 has 8 divisors (see below), whose sum is σ = 13123803316800. Its totient is φ = 13100400153360.
The previous prime is 13112101303267. The next prime is 13112101303321. The reversal of 13112101303313 is 31330310121131.
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 13112101303313 - 228 = 13111832867857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13112101303813) 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 7 ways as a sum of consecutive naturals, for example, 32351231 + ... + 32754027.
It is an arithmetic number, because the mean of its divisors is an integer number (1640475414600).
Almost surely, 213112101303313 is an apocalyptic number.
It is an amenable number.
13112101303313 is a deficient number, since it is larger than the sum of its proper divisors (11702013487).
13112101303313 is a wasteful number, since it uses less digits than its factorization.
13112101303313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431767.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13112101303313 its reverse (31330310121131), we get a palindrome (44442411424444).
The spelling of 13112101303313 in words is "thirteen trillion, one hundred twelve billion, one hundred one million, three hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •