Base | Representation |
---|---|
bin | 10111000010010011011001… |
… | …001110110111011111000001 |
3 | 111021201110102101022020001222 |
4 | 113002103121032313133001 |
5 | 101234404201240144301 |
6 | 555250411441404425 |
7 | 30224434561440362 |
oct | 2702233116673701 |
9 | 437643371266058 |
10 | 101313333131201 |
11 | 2a31081a357164 |
12 | b443252339715 |
13 | 446ba63640119 |
14 | 1b0383d081b69 |
15 | baa5d3eec31b |
hex | 5c24d93b77c1 |
101313333131201 has 8 divisors (see below), whose sum is σ = 103794813248544. Its totient is φ = 98837551018080.
The previous prime is 101313333131177. The next prime is 101313333131357. The reversal of 101313333131201 is 102131333313101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101313333131201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101313333137201) 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, 1424465060 + ... + 1424536181.
It is an arithmetic number, because the mean of its divisors is an integer number (12974351656068).
Almost surely, 2101313333131201 is an apocalyptic number.
It is an amenable number.
101313333131201 is a deficient number, since it is larger than the sum of its proper divisors (2481480117343).
101313333131201 is an equidigital number, since it uses as much as digits as its factorization.
101313333131201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2849002111.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 101313333131201 its reverse (102131333313101), we get a palindrome (203444666444302).
The spelling of 101313333131201 in words is "one hundred one trillion, three hundred thirteen billion, three hundred thirty-three million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •