Base | Representation |
---|---|
bin | 101111001110111010… |
… | …0110111111110011001 |
3 | 100200210222110011022102 |
4 | 1132131310313332121 |
5 | 3130213111201411 |
6 | 114333002333145 |
7 | 10220403614642 |
oct | 1363564677631 |
9 | 320728404272 |
10 | 101432131481 |
11 | 3a02088073a |
12 | 177a94ba1b5 |
13 | 974642b415 |
14 | 4ca33386c9 |
15 | 2989d29d3b |
hex | 179dd37f99 |
101432131481 has 2 divisors, whose sum is σ = 101432131482. Its totient is φ = 101432131480.
The previous prime is 101432131477. The next prime is 101432131487. The reversal of 101432131481 is 184131234101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 68256787600 + 33175343881 = 261260^2 + 182141^2 .
It is a cyclic number.
It is not a de Polignac number, because 101432131481 - 22 = 101432131477 is a prime.
It is a super-2 number, since 2×1014321314812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101432131487) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50716065740 + 50716065741.
It is an arithmetic number, because the mean of its divisors is an integer number (50716065741).
Almost surely, 2101432131481 is an apocalyptic number.
It is an amenable number.
101432131481 is a deficient number, since it is larger than the sum of its proper divisors (1).
101432131481 is an equidigital number, since it uses as much as digits as its factorization.
101432131481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 29.
Adding to 101432131481 its reverse (184131234101), we get a palindrome (285563365582).
The spelling of 101432131481 in words is "one hundred one billion, four hundred thirty-two million, one hundred thirty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •