Base | Representation |
---|---|
bin | 1001011110110001100110… |
… | …0010100100110001111101 |
3 | 1100220112222101002221222211 |
4 | 2113230121202210301331 |
5 | 2331242443403340331 |
6 | 34100510325140421 |
7 | 2124063136021411 |
oct | 227543142446175 |
9 | 40815871087884 |
10 | 10424314121341 |
11 | 3359a2161867a |
12 | 120437585a711 |
13 | 5a8015b963c3 |
14 | 28077a538d41 |
15 | 1312611ca8b1 |
hex | 97b198a4c7d |
10424314121341 has 2 divisors, whose sum is σ = 10424314121342. Its totient is φ = 10424314121340.
The previous prime is 10424314121311. The next prime is 10424314121359. The reversal of 10424314121341 is 14312141342401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5415464223225 + 5008849898116 = 2327115^2 + 2238046^2 .
It is a cyclic number.
It is not a de Polignac number, because 10424314121341 - 27 = 10424314121213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10424314121311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5212157060670 + 5212157060671.
It is an arithmetic number, because the mean of its divisors is an integer number (5212157060671).
Almost surely, 210424314121341 is an apocalyptic number.
It is an amenable number.
10424314121341 is a deficient number, since it is larger than the sum of its proper divisors (1).
10424314121341 is an equidigital number, since it uses as much as digits as its factorization.
10424314121341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 10424314121341 its reverse (14312141342401), we get a palindrome (24736455463742).
The spelling of 10424314121341 in words is "ten trillion, four hundred twenty-four billion, three hundred fourteen million, one hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •