Base | Representation |
---|---|
bin | 10111000001000110000000… |
… | …110000001010110110011111 |
3 | 111021102111221210000210112202 |
4 | 113001012000300022312133 |
5 | 101232024020020413211 |
6 | 555144310543522115 |
7 | 30215433552221405 |
oct | 2701060060126637 |
9 | 437374853023482 |
10 | 101230244310431 |
11 | 2a289561934345 |
12 | b42b123bb933b |
13 | 4463c815c5812 |
14 | 1add7d9dbd475 |
15 | ba836e79253b |
hex | 5c1180c0ad9f |
101230244310431 has 2 divisors, whose sum is σ = 101230244310432. Its totient is φ = 101230244310430.
The previous prime is 101230244310389. The next prime is 101230244310523. The reversal of 101230244310431 is 134013442032101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101230244310431 - 242 = 96832197799327 is a prime.
It is a super-2 number, since 2×1012302443104312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101230244310394 and 101230244310403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101230244310131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50615122155215 + 50615122155216.
It is an arithmetic number, because the mean of its divisors is an integer number (50615122155216).
Almost surely, 2101230244310431 is an apocalyptic number.
101230244310431 is a deficient number, since it is larger than the sum of its proper divisors (1).
101230244310431 is an equidigital number, since it uses as much as digits as its factorization.
101230244310431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 101230244310431 its reverse (134013442032101), we get a palindrome (235243686342532).
The spelling of 101230244310431 in words is "one hundred one trillion, two hundred thirty billion, two hundred forty-four million, three hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •