Base | Representation |
---|---|
bin | 1001011001010110110111… |
… | …1100110111101011000101 |
3 | 1100120122201221122112111001 |
4 | 2112111231330313223011 |
5 | 2323231340200120401 |
6 | 33550035005413301 |
7 | 2114256532511131 |
oct | 226255574675305 |
9 | 40518657575431 |
10 | 10331241020101 |
11 | 33235002480a1 |
12 | 11aa31b86a231 |
13 | 59c3024a6631 |
14 | 27a06b4463c1 |
15 | 12db1516a601 |
hex | 9656df37ac5 |
10331241020101 has 8 divisors (see below), whose sum is σ = 10610510027040. Its totient is φ = 10051974448848.
The previous prime is 10331241020099. The next prime is 10331241020159. The reversal of 10331241020101 is 10102014213301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10331241020101 - 21 = 10331241020099 is a prime.
It is a super-3 number, since 3×103312410201013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331241020801) 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, 10879110 + ... + 11790568.
It is an arithmetic number, because the mean of its divisors is an integer number (1326313753380).
Almost surely, 210331241020101 is an apocalyptic number.
It is an amenable number.
10331241020101 is a deficient number, since it is larger than the sum of its proper divisors (279269006939).
10331241020101 is an equidigital number, since it uses as much as digits as its factorization.
10331241020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1217843.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10331241020101 its reverse (10102014213301), we get a palindrome (20433255233402).
The spelling of 10331241020101 in words is "ten trillion, three hundred thirty-one billion, two hundred forty-one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •