Base | Representation |
---|---|
bin | 100110000001100100101… |
… | …110101001010010100010 |
3 | 100020210200120001210202221 |
4 | 212001210232221102202 |
5 | 320302441144042224 |
6 | 5320224234501254 |
7 | 356533215040504 |
oct | 46014456512242 |
9 | 10223616053687 |
10 | 2613030065314 |
11 | 9181a83942a9 |
12 | 36250a59482a |
13 | 15c53b88c1a6 |
14 | 90685487d74 |
15 | 47e86c3a6e4 |
hex | 26064ba94a2 |
2613030065314 has 8 divisors (see below), whose sum is σ = 3919618887660. Its totient is φ = 1306490436096.
The previous prime is 2613030065209. The next prime is 2613030065323. The reversal of 2613030065314 is 4135600303162.
It can be written as a sum of positive squares in 2 ways, for example, as 2603721096025 + 9308969289 = 1613605^2 + 96483^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-4 number, since 4×26130300653144 (a number of 51 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2613030065314.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 12165199 + ... + 12378130.
Almost surely, 22613030065314 is an apocalyptic number.
2613030065314 is a deficient number, since it is larger than the sum of its proper divisors (1306588822346).
2613030065314 is a wasteful number, since it uses less digits than its factorization.
2613030065314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24596564.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 2613030065314 its reverse (4135600303162), we get a palindrome (6748630368476).
The spelling of 2613030065314 in words is "two trillion, six hundred thirteen billion, thirty million, sixty-five thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •