Base | Representation |
---|---|
bin | 1001011111010010000111… |
… | …0001010000110101111101 |
3 | 1100221101111122101110000101 |
4 | 2113310201301100311331 |
5 | 2331413332240433112 |
6 | 34104512352401101 |
7 | 2124522336562642 |
oct | 227644161206575 |
9 | 40841448343011 |
10 | 10433042124157 |
11 | 33626a0321344 |
12 | 1205bb0846191 |
13 | 5a8aa71a1803 |
14 | 280d67789dc9 |
15 | 1315c257a757 |
hex | 97d21c50d7d |
10433042124157 has 2 divisors, whose sum is σ = 10433042124158. Its totient is φ = 10433042124156.
The previous prime is 10433042124133. The next prime is 10433042124259. The reversal of 10433042124157 is 75142124033401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10408695515001 + 24346609156 = 3226251^2 + 156034^2 .
It is a cyclic number.
It is not a de Polignac number, because 10433042124157 - 227 = 10432907906429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10433045124157) 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, 5216521062078 + 5216521062079.
It is an arithmetic number, because the mean of its divisors is an integer number (5216521062079).
Almost surely, 210433042124157 is an apocalyptic number.
It is an amenable number.
10433042124157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10433042124157 is an equidigital number, since it uses as much as digits as its factorization.
10433042124157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 37.
Adding to 10433042124157 its reverse (75142124033401), we get a palindrome (85575166157558).
The spelling of 10433042124157 in words is "ten trillion, four hundred thirty-three billion, forty-two million, one hundred twenty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •