Base | Representation |
---|---|
bin | 110001100111110001000… |
… | …0101010010001111110001 |
3 | 220010222100222120201121001 |
4 | 1203033202011102033301 |
5 | 1343214131432310100 |
6 | 22301004401002001 |
7 | 1302502426446244 |
oct | 143174205221761 |
9 | 26128328521531 |
10 | 6819906135025 |
11 | 219a340245005 |
12 | 9218b0923301 |
13 | 3a616440ab99 |
14 | 198129ba525b |
15 | bc604b53d6a |
hex | 633e21523f1 |
6819906135025 has 27 divisors (see below), whose sum is σ = 8668655410593. Its totient is φ = 5322435729600.
The previous prime is 6819906135017. The next prime is 6819906135043. The reversal of 6819906135025 is 5205316099186.
The square root of 6819906135025 is 2611495.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 2870608438369 + 3949297696656 = 1694287^2 + 1987284^2 .
It is not a de Polignac number, because 6819906135025 - 23 = 6819906135017 is a prime.
It is a super-2 number, since 2×68199061350252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 535350106 + ... + 535362844.
Almost surely, 26819906135025 is an apocalyptic number.
6819906135025 is the 2611495-th square number.
6819906135025 is the 1305748-th centered octagonal number.
It is an amenable number.
6819906135025 is a deficient number, since it is larger than the sum of its proper divisors (1848749275568).
6819906135025 is an frugal number, since it uses more digits than its factorization.
6819906135025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25570 (or 12785 counting only the distinct ones).
The product of its (nonzero) digits is 3499200, while the sum is 55.
The spelling of 6819906135025 in words is "six trillion, eight hundred nineteen billion, nine hundred six million, one hundred thirty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •