Base | Representation |
---|---|
bin | 101111001001001110… |
… | …0111011001111011111 |
3 | 100200022200101010021002 |
4 | 1132102130323033133 |
5 | 3124320233212111 |
6 | 114302024300515 |
7 | 10212565612460 |
oct | 1362234731737 |
9 | 320280333232 |
10 | 101241304031 |
11 | 39a330931aa |
12 | 1775561173b |
13 | 9715a3617a |
14 | 4c85c62d67 |
15 | 29781d363b |
hex | 179273b3df |
101241304031 has 8 divisors (see below), whose sum is σ = 115906986624. Its totient is φ = 86626281240.
The previous prime is 101241304009. The next prime is 101241304037. The reversal of 101241304031 is 130403142101.
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-101241304031 is a prime.
It is a super-2 number, since 2×1012413040312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101241303994 and 101241304012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101241304037) 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, 12660665 + ... + 12668658.
It is an arithmetic number, because the mean of its divisors is an integer number (14488373328).
Almost surely, 2101241304031 is an apocalyptic number.
101241304031 is a deficient number, since it is larger than the sum of its proper divisors (14665682593).
101241304031 is an equidigital number, since it uses as much as digits as its factorization.
101241304031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25329901.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 101241304031 its reverse (130403142101), we get a palindrome (231644446132).
The spelling of 101241304031 in words is "one hundred one billion, two hundred forty-one million, three hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •