Base | Representation |
---|---|
bin | 1100100100010010… |
… | …11111011110011101 |
3 | 122102012112111201020 |
4 | 12102021133132131 |
5 | 102304203212203 |
6 | 3033254034353 |
7 | 326123644044 |
oct | 62211373635 |
9 | 18365474636 |
10 | 6746929053 |
11 | 2952513727 |
12 | 13836489b9 |
13 | 836a59817 |
14 | 4800c155b |
15 | 2974ca153 |
hex | 19225f79d |
6746929053 has 8 divisors (see below), whose sum is σ = 8999910816. Its totient is φ = 4495950000.
The previous prime is 6746929027. The next prime is 6746929073. The reversal of 6746929053 is 3509296476.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6746929053 - 212 = 6746924957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6746928987 and 6746929005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6746929003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 492798 + ... + 506303.
It is an arithmetic number, because the mean of its divisors is an integer number (1124988852).
Almost surely, 26746929053 is an apocalyptic number.
It is an amenable number.
6746929053 is a deficient number, since it is larger than the sum of its proper divisors (2252981763).
6746929053 is a wasteful number, since it uses less digits than its factorization.
6746929053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001355.
The product of its (nonzero) digits is 2449440, while the sum is 51.
The square root of 6746929053 is about 82139.6923113302. The cubic root of 6746929053 is about 1889.5949276067.
The spelling of 6746929053 in words is "six billion, seven hundred forty-six million, nine hundred twenty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •