Base | Representation |
---|---|
bin | 101100100101010001001… |
… | …101101010110111001101 |
3 | 101211212212201112210110212 |
4 | 230211101031222313031 |
5 | 400143401100014411 |
6 | 10303233231012205 |
7 | 434225463124304 |
oct | 54452115526715 |
9 | 11755781483425 |
10 | 3063674219981 |
11 | a8132a255681 |
12 | 41591636a065 |
13 | 192b9855574b |
14 | a83d573943b |
15 | 54a5e81968b |
hex | 2c95136adcd |
3063674219981 has 2 divisors, whose sum is σ = 3063674219982. Its totient is φ = 3063674219980.
The previous prime is 3063674219959. The next prime is 3063674220049. The reversal of 3063674219981 is 1899124763603.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1923977055625 + 1139697164356 = 1387075^2 + 1067566^2 .
It is a cyclic number.
It is not a de Polignac number, because 3063674219981 - 26 = 3063674219917 is a prime.
It is a super-2 number, since 2×30636742199812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3063674219981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3063674219381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1531837109990 + 1531837109991.
It is an arithmetic number, because the mean of its divisors is an integer number (1531837109991).
Almost surely, 23063674219981 is an apocalyptic number.
It is an amenable number.
3063674219981 is a deficient number, since it is larger than the sum of its proper divisors (1).
3063674219981 is an equidigital number, since it uses as much as digits as its factorization.
3063674219981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11757312, while the sum is 59.
The spelling of 3063674219981 in words is "three trillion, sixty-three billion, six hundred seventy-four million, two hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •