Base | Representation |
---|---|
bin | 101100000010010111001… |
… | …011101101101000110001 |
3 | 101201022010121210012020021 |
4 | 230002113023231220301 |
5 | 344040121003002023 |
6 | 10234114123043441 |
7 | 431430615352534 |
oct | 54022713555061 |
9 | 11638117705207 |
10 | 3026193406513 |
11 | a67446315782 |
12 | 40a5b6070581 |
13 | 18c4a438c704 |
14 | a667b974a1b |
15 | 53ab909d35d |
hex | 2c0972eda31 |
3026193406513 has 4 divisors (see below), whose sum is σ = 3029741113588. Its totient is φ = 3022645699440.
The previous prime is 3026193406499. The next prime is 3026193406529. The reversal of 3026193406513 is 3156043916203.
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 242524731024 + 2783668675489 = 492468^2 + 1668433^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3026193406513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3026193406513.
It is not an unprimeable number, because it can be changed into a prime (3026193406213) 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, 1773852258 + ... + 1773853963.
It is an arithmetic number, because the mean of its divisors is an integer number (757435278397).
Almost surely, 23026193406513 is an apocalyptic number.
It is an amenable number.
3026193406513 is a deficient number, since it is larger than the sum of its proper divisors (3547707075).
3026193406513 is an equidigital number, since it uses as much as digits as its factorization.
3026193406513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3547707074.
The product of its (nonzero) digits is 349920, while the sum is 43.
The spelling of 3026193406513 in words is "three trillion, twenty-six billion, one hundred ninety-three million, four hundred six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •