Base | Representation |
---|---|
bin | 101100100010111110000… |
… | …011000100010000110001 |
3 | 101211122111122122001122012 |
4 | 230202332003010100301 |
5 | 400123322012032211 |
6 | 10302144231052305 |
7 | 434110342533242 |
oct | 54427603042061 |
9 | 11748448561565 |
10 | 3061205189681 |
11 | a80282584671 |
12 | 415347511095 |
13 | 192893b7a782 |
14 | a823d86acc9 |
15 | 54967ba9d8b |
hex | 2c8be0c4431 |
3061205189681 has 8 divisors (see below), whose sum is σ = 3095659353600. Its totient is φ = 3026752328160.
The previous prime is 3061205189663. The next prime is 3061205189747. The reversal of 3061205189681 is 1869815021603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3061205189681 - 226 = 3061138080817 is a prime.
It is a super-2 number, since 2×30612051896812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3061205189641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4864640 + ... + 5457758.
It is an arithmetic number, because the mean of its divisors is an integer number (386957419200).
Almost surely, 23061205189681 is an apocalyptic number.
It is an amenable number.
3061205189681 is a deficient number, since it is larger than the sum of its proper divisors (34454163919).
3061205189681 is an equidigital number, since it uses as much as digits as its factorization.
3061205189681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651199.
The product of its (nonzero) digits is 622080, while the sum is 50.
The spelling of 3061205189681 in words is "three trillion, sixty-one billion, two hundred five million, one hundred eighty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •