Base | Representation |
---|---|
bin | 1010100110010111… |
… | …00000101000110101 |
3 | 112200120200000120021 |
4 | 11103023200220311 |
5 | 43123231242433 |
6 | 2340355005141 |
7 | 261005253016 |
oct | 52313405065 |
9 | 15616600507 |
10 | 5690493493 |
11 | 2460153a93 |
12 | 11298997b1 |
13 | 6c8c1cc19 |
14 | 3bda8300d |
15 | 23489c22d |
hex | 1532e0a35 |
5690493493 has 4 divisors (see below), whose sum is σ = 5693507820. Its totient is φ = 5687479168.
The previous prime is 5690493469. The next prime is 5690493499. The reversal of 5690493493 is 3943940965.
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 2108830084 + 3581663409 = 45922^2 + 59847^2 .
It is a cyclic number.
It is not a de Polignac number, because 5690493493 - 25 = 5690493461 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 5690493493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5690493499) 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, 1504330 + ... + 1508107.
It is an arithmetic number, because the mean of its divisors is an integer number (1423376955).
Almost surely, 25690493493 is an apocalyptic number.
It is an amenable number.
5690493493 is a deficient number, since it is larger than the sum of its proper divisors (3014327).
5690493493 is a wasteful number, since it uses less digits than its factorization.
5690493493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3014326.
The product of its (nonzero) digits is 3149280, while the sum is 52.
The square root of 5690493493 is about 75435.3596995467. The cubic root of 5690493493 is about 1785.3223575971.
The spelling of 5690493493 in words is "five billion, six hundred ninety million, four hundred ninety-three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •