Base | Representation |
---|---|
bin | 10111000011101000110011… |
… | …011101111011100001000011 |
3 | 111022001020010200111001121121 |
4 | 113003220303131323201003 |
5 | 101242410011040430111 |
6 | 555400455522533111 |
7 | 30234162312406033 |
oct | 2703506335734103 |
9 | 438036120431547 |
10 | 101405041342531 |
11 | 2a346700239753 |
12 | b458b87207197 |
13 | 44775ba325324 |
14 | 1b0805cba18c3 |
15 | bacba0300871 |
hex | 5c3a3377b843 |
101405041342531 has 8 divisors (see below), whose sum is σ = 102495473608640. Its totient is φ = 100319764785192.
The previous prime is 101405041342529. The next prime is 101405041342537. The reversal of 101405041342531 is 135243140504101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101405041342531 - 21 = 101405041342529 is a prime.
It is a super-2 number, since 2×1014050413425312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
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 in 7 ways as a sum of consecutive naturals, for example, 1288887645 + ... + 1288966318.
It is an arithmetic number, because the mean of its divisors is an integer number (12811934201080).
Almost surely, 2101405041342531 is an apocalyptic number.
101405041342531 is a deficient number, since it is larger than the sum of its proper divisors (1090432266109).
101405041342531 is a wasteful number, since it uses less digits than its factorization.
101405041342531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2577854385.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 101405041342531 its reverse (135243140504101), we get a palindrome (236648181846632).
The spelling of 101405041342531 in words is "one hundred one trillion, four hundred five billion, forty-one million, three hundred forty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •