Base | Representation |
---|---|
bin | 10011110110101011111… |
… | …11100110111101000001 |
3 | 2102012212100100110001100 |
4 | 21323111333212331001 |
5 | 42134113413220101 |
6 | 1241221315325013 |
7 | 100200300200100 |
oct | 11732577467501 |
9 | 2365770313040 |
10 | 682195054401 |
11 | 243354361523 |
12 | b02698b0769 |
13 | 4c43b781883 |
14 | 25038770037 |
15 | 12b2adcce86 |
hex | 9ed5fe6f41 |
682195054401 has 81 divisors (see below), whose sum is σ = 1179200302371. Its totient is φ = 378933103584.
The previous prime is 682195054369. The next prime is 682195054421. The reversal of 682195054401 is 104450591286.
The square root of 682195054401 is 825951.
It is a perfect power (a square), and thus also a powerful number.
682195054401 is a `hidden beast` number, since 6 + 8 + 2 + 195 + 0 + 54 + 401 = 666.
It can be written as a sum of positive squares in only one way, i.e., 610437503025 + 71757551376 = 781305^2 + 267876^2 .
It is not a de Polignac number, because 682195054401 - 25 = 682195054369 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (682195054421) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 641763396 + ... + 641764458.
Almost surely, 2682195054401 is an apocalyptic number.
682195054401 is the 825951-st square number.
682195054401 is the 412976-th centered octagonal number.
It is an amenable number.
682195054401 is a deficient number, since it is larger than the sum of its proper divisors (497005247970).
682195054401 is an equidigital number, since it uses as much as digits as its factorization.
682195054401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2220 (or 1110 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 45.
The spelling of 682195054401 in words is "six hundred eighty-two billion, one hundred ninety-five million, fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •