Base | Representation |
---|---|
bin | 11110010110011100000… |
… | …01010100001100000011 |
3 | 10200200202012200120200011 |
4 | 33023032001110030003 |
5 | 114041213131140323 |
6 | 2115023505005351 |
7 | 135225340210546 |
oct | 17131601241403 |
9 | 3620665616604 |
10 | 1042838536963 |
11 | 3722a1192853 |
12 | 14a138623857 |
13 | 7745444bc72 |
14 | 3868b9ca85d |
15 | 1c1d754b20d |
hex | f2ce054303 |
1042838536963 has 2 divisors, whose sum is σ = 1042838536964. Its totient is φ = 1042838536962.
The previous prime is 1042838536939. The next prime is 1042838537033. The reversal of 1042838536963 is 3696358382401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1042838536963 - 29 = 1042838536451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1042838536898 and 1042838536907.
It is not a weakly prime, because it can be changed into another prime (1042838536903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521419268481 + 521419268482.
It is an arithmetic number, because the mean of its divisors is an integer number (521419268482).
Almost surely, 21042838536963 is an apocalyptic number.
1042838536963 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042838536963 is an equidigital number, since it uses as much as digits as its factorization.
1042838536963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22394880, while the sum is 58.
The spelling of 1042838536963 in words is "one trillion, forty-two billion, eight hundred thirty-eight million, five hundred thirty-six thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •