Base | Representation |
---|---|
bin | 1001010111100111110010… |
… | …0110011000100000001101 |
3 | 1100110210202210220222220111 |
4 | 2111321330212120200031 |
5 | 2322234303013344204 |
6 | 33524224040520021 |
7 | 2112152561232532 |
oct | 225717446304015 |
9 | 40423683828814 |
10 | 10301422012429 |
11 | 33118991942a9 |
12 | 11a4599480011 |
13 | 59955c771cb2 |
14 | 27883d072d89 |
15 | 12ce6c393d04 |
hex | 95e7c99880d |
10301422012429 has 2 divisors, whose sum is σ = 10301422012430. Its totient is φ = 10301422012428.
The previous prime is 10301422012403. The next prime is 10301422012459. The reversal of 10301422012429 is 92421022410301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5856893690404 + 4444528322025 = 2420102^2 + 2108205^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301422012429 - 227 = 10301287794701 is a prime.
It is a super-2 number, since 2×103014220124292 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10301422012429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10301422012459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150711006214 + 5150711006215.
It is an arithmetic number, because the mean of its divisors is an integer number (5150711006215).
Almost surely, 210301422012429 is an apocalyptic number.
It is an amenable number.
10301422012429 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301422012429 is an equidigital number, since it uses as much as digits as its factorization.
10301422012429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 10301422012429 in words is "ten trillion, three hundred one billion, four hundred twenty-two million, twelve thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •