Base | Representation |
---|---|
bin | 10111000011101000110011… |
… | …011101111011100001000100 |
3 | 111022001020010200111001121122 |
4 | 113003220303131323201010 |
5 | 101242410011040430112 |
6 | 555400455522533112 |
7 | 30234162312406034 |
oct | 2703506335734104 |
9 | 438036120431548 |
10 | 101405041342532 |
11 | 2a346700239754 |
12 | b458b87207198 |
13 | 44775ba325325 |
14 | 1b0805cba18c4 |
15 | bacba0300872 |
hex | 5c3a3377b844 |
101405041342532 has 6 divisors (see below), whose sum is σ = 177458822349438. Its totient is φ = 50702520671264.
The previous prime is 101405041342529. The next prime is 101405041342537. The reversal of 101405041342532 is 235243140504101.
It can be written as a sum of positive squares in only one way, i.e., 64963825680196 + 36441215662336 = 8060014^2 + 6036656^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101405041342492 and 101405041342501.
It is not an unprimeable number, because it can be changed into a prime (101405041342537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12675630167813 + ... + 12675630167820.
It is an arithmetic number, because the mean of its divisors is an integer number (29576470391573).
Almost surely, 2101405041342532 is an apocalyptic number.
It is an amenable number.
101405041342532 is a deficient number, since it is larger than the sum of its proper divisors (76053781006906).
101405041342532 is a wasteful number, since it uses less digits than its factorization.
101405041342532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25351260335637 (or 25351260335635 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 101405041342532 its reverse (235243140504101), we get a palindrome (336648181846633).
The spelling of 101405041342532 in words is "one hundred one trillion, four hundred five billion, forty-one million, three hundred forty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •