Base | Representation |
---|---|
bin | 1011111000000111011000… |
… | …1010111000000100000001 |
3 | 1201020101202002012001000001 |
4 | 2332001312022320010001 |
5 | 3202423140341024101 |
6 | 43435024244000001 |
7 | 2515313225155201 |
oct | 276016612700401 |
9 | 51211662161001 |
10 | 13058683142401 |
11 | 418517a216196 |
12 | 156aa3a690001 |
13 | 739575657610 |
14 | 332087a4a401 |
15 | 179a464b9901 |
hex | be0762b8101 |
13058683142401 has 4 divisors (see below), whose sum is σ = 14063197230292. Its totient is φ = 12054169054512.
The previous prime is 13058683142389. The next prime is 13058683142411. The reversal of 13058683142401 is 10424138685031.
It is a Cunningham number, because it is equal to 36136802+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1931755295376 + 11126927847025 = 1389876^2 + 3335705^2 .
It is not a de Polignac number, because 13058683142401 - 225 = 13058649587969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13058683142411) 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, 502257043926 + ... + 502257043951.
It is an arithmetic number, because the mean of its divisors is an integer number (3515799307573).
Almost surely, 213058683142401 is an apocalyptic number.
It is an amenable number.
13058683142401 is a deficient number, since it is larger than the sum of its proper divisors (1004514087891).
13058683142401 is a wasteful number, since it uses less digits than its factorization.
13058683142401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004514087890.
The product of its (nonzero) digits is 552960, while the sum is 46.
The spelling of 13058683142401 in words is "thirteen trillion, fifty-eight billion, six hundred eighty-three million, one hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •