Base | Representation |
---|---|
bin | 1001011111000110110100… |
… | …0110110101011110011011 |
3 | 1100221002200101222121211101 |
4 | 2113301231012311132123 |
5 | 2331341130320300011 |
6 | 34103251515212231 |
7 | 2124354253406644 |
oct | 227615506653633 |
9 | 40832611877741 |
10 | 10430011103131 |
11 | 33613853a3394 |
12 | 12054a5747077 |
13 | 5a8713248649 |
14 | 280b5adca6cb |
15 | 13149640a2c1 |
hex | 97c6d1b579b |
10430011103131 has 2 divisors, whose sum is σ = 10430011103132. Its totient is φ = 10430011103130.
The previous prime is 10430011103129. The next prime is 10430011103153. The reversal of 10430011103131 is 13130111003401.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10430011103131 - 21 = 10430011103129 is a prime.
It is a super-2 number, since 2×104300111031312 (a number of 27 digits) contains 22 as substring.
Together with 10430011103129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10430011103099 and 10430011103108.
It is not a weakly prime, because it can be changed into another prime (10430011103101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5215005551565 + 5215005551566.
It is an arithmetic number, because the mean of its divisors is an integer number (5215005551566).
Almost surely, 210430011103131 is an apocalyptic number.
10430011103131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10430011103131 is an equidigital number, since it uses as much as digits as its factorization.
10430011103131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10430011103131 its reverse (13130111003401), we get a palindrome (23560122106532).
The spelling of 10430011103131 in words is "ten trillion, four hundred thirty billion, eleven million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •