Base | Representation |
---|---|
bin | 10010111011110001011… |
… | …101010010111010100101 |
3 | 11121101110001201220022221 |
4 | 102323301131102322211 |
5 | 132304204031041401 |
6 | 2433421551152341 |
7 | 163001145654322 |
oct | 22736135227245 |
9 | 4541401656287 |
10 | 1301131112101 |
11 | 461896657487 |
12 | 1902022156b1 |
13 | 9590854c342 |
14 | 46d918a5b49 |
15 | 23ca33a47a1 |
hex | 12ef1752ea5 |
1301131112101 has 8 divisors (see below), whose sum is σ = 1328835847680. Its totient is φ = 1273427255568.
The previous prime is 1301131112089. The next prime is 1301131112111. The reversal of 1301131112101 is 1012111311031.
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 1301131112101 - 25 = 1301131112069 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 (1301131112111) 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, 3400095 + ... + 3763363.
It is an arithmetic number, because the mean of its divisors is an integer number (166104480960).
Almost surely, 21301131112101 is an apocalyptic number.
It is an amenable number.
1301131112101 is a deficient number, since it is larger than the sum of its proper divisors (27704735579).
1301131112101 is an equidigital number, since it uses as much as digits as its factorization.
1301131112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439523.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1301131112101 its reverse (1012111311031), we get a palindrome (2313242423132).
The spelling of 1301131112101 in words is "one trillion, three hundred one billion, one hundred thirty-one million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •