Base | Representation |
---|---|
bin | 1011111000010101000100… |
… | …0000100111101011010001 |
3 | 1201020202012221210122222212 |
4 | 2332011101000213223101 |
5 | 3203003200243223040 |
6 | 43440432441241505 |
7 | 2515503216452213 |
oct | 276052100475321 |
9 | 51222187718885 |
10 | 13062354664145 |
11 | 4186793744886 |
12 | 156b6a4193295 |
13 | 739a0c1b9aa7 |
14 | 3323154d65b3 |
15 | 179bad9a7d65 |
hex | be151027ad1 |
13062354664145 has 8 divisors (see below), whose sum is σ = 15970577023656. Its totient is φ = 10252716113536.
The previous prime is 13062354664103. The next prime is 13062354664169. The reversal of 13062354664145 is 54146645326031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 444258241729 + 12618096422416 = 666527^2 + 3552196^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13062354664145 - 26 = 13062354664081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13062354664093 and 13062354664102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24645951932 + ... + 24645952461.
It is an arithmetic number, because the mean of its divisors is an integer number (1996322127957).
Almost surely, 213062354664145 is an apocalyptic number.
It is an amenable number.
13062354664145 is a deficient number, since it is larger than the sum of its proper divisors (2908222359511).
13062354664145 is an equidigital number, since it uses as much as digits as its factorization.
13062354664145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49291904451.
The product of its (nonzero) digits is 6220800, while the sum is 50.
The spelling of 13062354664145 in words is "thirteen trillion, sixty-two billion, three hundred fifty-four million, six hundred sixty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •