Base | Representation |
---|---|
bin | 1011111010100110001011… |
… | …1011110100011000001001 |
3 | 1201101110202211022220020111 |
4 | 2332221202323310120021 |
5 | 3204122440341213001 |
6 | 43510354143354321 |
7 | 2521352451300343 |
oct | 276514273643011 |
9 | 51343684286214 |
10 | 13101310101001 |
11 | 41a12640020a1 |
12 | 15771562b29a1 |
13 | 7405a9a2b645 |
14 | 33416d076293 |
15 | 17abdd909851 |
hex | bea62ef4609 |
13101310101001 has 8 divisors (see below), whose sum is σ = 13222716164064. Its totient is φ = 12980228220960.
The previous prime is 13101310100987. The next prime is 13101310101023. The reversal of 13101310101001 is 10010101310131.
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 13101310101001 - 27 = 13101310100873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13101310101031) 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, 80964555 + ... + 81126208.
It is an arithmetic number, because the mean of its divisors is an integer number (1652839520508).
Almost surely, 213101310101001 is an apocalyptic number.
It is an amenable number.
13101310101001 is a deficient number, since it is larger than the sum of its proper divisors (121406063063).
13101310101001 is a wasteful number, since it uses less digits than its factorization.
13101310101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162091511.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 13101310101001 its reverse (10010101310131), we get a palindrome (23111411411132).
The spelling of 13101310101001 in words is "thirteen trillion, one hundred one billion, three hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •