Base | Representation |
---|---|
bin | 1010000001010111… |
… | …0000000000000001 |
3 | 20221110211000100212 |
4 | 2200111300000001 |
5 | 21002123244233 |
6 | 1122533123505 |
7 | 123443046266 |
oct | 24025600001 |
9 | 6843730325 |
10 | 2690056193 |
11 | 1160515040 |
12 | 630a89595 |
13 | 33b414636 |
14 | 1b73a526d |
15 | 10b26da48 |
hex | a0570001 |
2690056193 has 4 divisors (see below), whose sum is σ = 2934606768. Its totient is φ = 2445505620.
The previous prime is 2690056151. The next prime is 2690056223. The reversal of 2690056193 is 3916500962.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2690056193 - 28 = 2690055937 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 2690056193.
It is not an unprimeable number, because it can be changed into a prime (2690050193) 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, 122275271 + ... + 122275292.
It is an arithmetic number, because the mean of its divisors is an integer number (733651692).
It is a Proth number, since it is equal to 41047 ⋅ 216 + 1 and 41047 < 216.
Almost surely, 22690056193 is an apocalyptic number.
It is an amenable number.
2690056193 is a deficient number, since it is larger than the sum of its proper divisors (244550575).
2690056193 is a wasteful number, since it uses less digits than its factorization.
2690056193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244550574.
The product of its (nonzero) digits is 87480, while the sum is 41.
The square root of 2690056193 is about 51865.7516382439. The cubic root of 2690056193 is about 1390.7651004129.
The spelling of 2690056193 in words is "two billion, six hundred ninety million, fifty-six thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •