Base | Representation |
---|---|
bin | 100010100111001111111… |
… | …111101100010000010101 |
3 | 22102101121011202112212021 |
4 | 202213033333230100111 |
5 | 302432341230312431 |
6 | 5020414452053141 |
7 | 333564041416441 |
oct | 42471777542025 |
9 | 8371534675767 |
10 | 2378606494741 |
11 | 8378413a1024 |
12 | 324ba66041b1 |
13 | 1433bc8b1559 |
14 | 831a7669821 |
15 | 41d16649b11 |
hex | 229cffec415 |
2378606494741 has 2 divisors, whose sum is σ = 2378606494742. Its totient is φ = 2378606494740.
The previous prime is 2378606494729. The next prime is 2378606494829. The reversal of 2378606494741 is 1474946068732.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2302791075025 + 75815419716 = 1517495^2 + 275346^2 .
It is a cyclic number.
It is not a de Polignac number, because 2378606494741 - 27 = 2378606494613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2378606494741.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2378606494711) 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, 1189303247370 + 1189303247371.
It is an arithmetic number, because the mean of its divisors is an integer number (1189303247371).
Almost surely, 22378606494741 is an apocalyptic number.
It is an amenable number.
2378606494741 is a deficient number, since it is larger than the sum of its proper divisors (1).
2378606494741 is an equidigital number, since it uses as much as digits as its factorization.
2378606494741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48771072, while the sum is 61.
The spelling of 2378606494741 in words is "two trillion, three hundred seventy-eight billion, six hundred six million, four hundred ninety-four thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •