Base | Representation |
---|---|
bin | 10111000010100100111010… |
… | …010101011000111100010001 |
3 | 111021210020222012200211222221 |
4 | 113002210322111120330101 |
5 | 101240211211334201431 |
6 | 555303202103101041 |
7 | 30226001642152663 |
oct | 2702447225307421 |
9 | 437706865624887 |
10 | 101332142100241 |
11 | 2a3187a1545a78 |
12 | b446a21441781 |
13 | 4470770343ac0 |
14 | 1b047050d0533 |
15 | baad35400111 |
hex | 5c293a558f11 |
101332142100241 has 16 divisors (see below), whose sum is σ = 110917390863888. Its totient is φ = 92002716115200.
The previous prime is 101332142100151. The next prime is 101332142100257. The reversal of 101332142100241 is 142001241233101.
It can be written as a sum of positive squares in 8 ways, for example, as 62940272641 + 101269201827600 = 250879^2 + 10063260^2 .
It is a cyclic number.
It is not a de Polignac number, because 101332142100241 - 225 = 101332108545809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101332142100641) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60441015 + ... + 62094931.
It is an arithmetic number, because the mean of its divisors is an integer number (6932336928993).
Almost surely, 2101332142100241 is an apocalyptic number.
It is an amenable number.
101332142100241 is a deficient number, since it is larger than the sum of its proper divisors (9585248763647).
101332142100241 is a wasteful number, since it uses less digits than its factorization.
101332142100241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1731252.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101332142100241 its reverse (142001241233101), we get a palindrome (243333383333342).
The spelling of 101332142100241 in words is "one hundred one trillion, three hundred thirty-two billion, one hundred forty-two million, one hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •