Base | Representation |
---|---|
bin | 100101110111111111000… |
… | …000111111010010101001 |
3 | 100012211002222120101122221 |
4 | 211313333000333102221 |
5 | 320120344304212101 |
6 | 5311402423114041 |
7 | 356020111053154 |
oct | 45677700772251 |
9 | 10184088511587 |
10 | 2602733663401 |
11 | 9138a4333133 |
12 | 3605162a2921 |
13 | 15b58a663891 |
14 | 8dd89c0ac9b |
15 | 47a82d2eaa1 |
hex | 25dff03f4a9 |
2602733663401 has 9 divisors (see below), whose sum is σ = 2695626363703. Its totient is φ = 2512939054360.
The previous prime is 2602733663311. The next prime is 2602733663419. The reversal of 2602733663401 is 1043663372062.
The square root of 2602733663401 is 1613299.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1364810399001 + 1237923264400 = 1168251^2 + 1112620^2 .
It is not a de Polignac number, because 2602733663401 - 213 = 2602733655209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2602733613401) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 46757856 + ... + 46813486.
Almost surely, 22602733663401 is an apocalyptic number.
2602733663401 is the 1613299-th square number.
2602733663401 is the 806650-th centered octagonal number.
It is an amenable number.
2602733663401 is a deficient number, since it is larger than the sum of its proper divisors (92892700302).
2602733663401 is an frugal number, since it uses more digits than its factorization.
2602733663401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111320 (or 55660 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 43.
The spelling of 2602733663401 in words is "two trillion, six hundred two billion, seven hundred thirty-three million, six hundred sixty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •