Base | Representation |
---|---|
bin | 1001101100011001… |
… | …1000110101000001 |
3 | 20201100101120012012 |
4 | 2123012120311001 |
5 | 20312122034131 |
6 | 1110112542305 |
7 | 121324564601 |
oct | 23306306501 |
9 | 6640346165 |
10 | 2602143041 |
11 | 1115929643 |
12 | 607551995 |
13 | 326143514 |
14 | 1a983cc01 |
15 | 1036a552b |
hex | 9b198d41 |
2602143041 has 4 divisors (see below), whose sum is σ = 2602324992. Its totient is φ = 2601961092.
The previous prime is 2602142987. The next prime is 2602143073. The reversal of 2602143041 is 1403412062.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2602143041 - 222 = 2597948737 is a prime.
It is a super-2 number, since 2×26021430412 = 13542296811649455362, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2602142998 and 2602143016.
It is not an unprimeable number, because it can be changed into a prime (2602103041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67505 + ... + 98798.
It is an arithmetic number, because the mean of its divisors is an integer number (650581248).
Almost surely, 22602143041 is an apocalyptic number.
It is an amenable number.
2602143041 is a deficient number, since it is larger than the sum of its proper divisors (181951).
2602143041 is a wasteful number, since it uses less digits than its factorization.
2602143041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181950.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 2602143041 is about 51011.2050533998. The cubic root of 2602143041 is about 1375.4465619065.
The spelling of 2602143041 in words is "two billion, six hundred two million, one hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •