Base | Representation |
---|---|
bin | 10011011111111011000111… |
… | …01000010000000011010011 |
3 | 12121211010110112122111012112 |
4 | 21233331203220100003103 |
5 | 21110004304440334414 |
6 | 231110011033415535 |
7 | 12013566663341246 |
oct | 1157754350200323 |
9 | 177733415574175 |
10 | 42878330011859 |
11 | 12731663501941 |
12 | 4986135b6a5ab |
13 | 1ac0541c41234 |
14 | a8347235725d |
15 | 4e556ca83d3e |
hex | 26ff63a100d3 |
42878330011859 has 2 divisors, whose sum is σ = 42878330011860. Its totient is φ = 42878330011858.
The previous prime is 42878330011823. The next prime is 42878330011873. The reversal of 42878330011859 is 95811003387824.
42878330011859 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42878330011859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42878330011798 and 42878330011807.
It is not a weakly prime, because it can be changed into another prime (42878330071859) 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, 21439165005929 + 21439165005930.
It is an arithmetic number, because the mean of its divisors is an integer number (21439165005930).
Almost surely, 242878330011859 is an apocalyptic number.
42878330011859 is a deficient number, since it is larger than the sum of its proper divisors (1).
42878330011859 is an equidigital number, since it uses as much as digits as its factorization.
42878330011859 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 59.
The spelling of 42878330011859 in words is "forty-two trillion, eight hundred seventy-eight billion, three hundred thirty million, eleven thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •