Base | Representation |
---|---|
bin | 1001110001010100101000… |
… | …0111101110010100111011 |
3 | 1102001000110010102110010111 |
4 | 2130111022013232110323 |
5 | 2402003033411333133 |
6 | 34503125102325151 |
7 | 2156103324444424 |
oct | 234251207562473 |
9 | 42030403373114 |
10 | 10742956746043 |
11 | 3472076018825 |
12 | 12560825897b7 |
13 | 5cc0970c6592 |
14 | 291d6758864b |
15 | 1396b03801cd |
hex | 9c54a1ee53b |
10742956746043 has 2 divisors, whose sum is σ = 10742956746044. Its totient is φ = 10742956746042.
The previous prime is 10742956746007. The next prime is 10742956746101. The reversal of 10742956746043 is 34064765924701.
It is a happy number.
It is an a-pointer prime, because the next prime (10742956746101) can be obtained adding 10742956746043 to its sum of digits (58).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10742956746043 - 233 = 10734366811451 is a prime.
It is a super-2 number, since 2×107429567460432 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10742956746443) 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, 5371478373021 + 5371478373022.
It is an arithmetic number, because the mean of its divisors is an integer number (5371478373022).
Almost surely, 210742956746043 is an apocalyptic number.
10742956746043 is a deficient number, since it is larger than the sum of its proper divisors (1).
10742956746043 is an equidigital number, since it uses as much as digits as its factorization.
10742956746043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30481920, while the sum is 58.
The spelling of 10742956746043 in words is "ten trillion, seven hundred forty-two billion, nine hundred fifty-six million, seven hundred forty-six thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •