Base | Representation |
---|---|
bin | 101100010000011001111… |
… | …011100110011101101011 |
3 | 101202202001110122000202102 |
4 | 230100121323212131223 |
5 | 344312011101300021 |
6 | 10245050243324015 |
7 | 432503360422142 |
oct | 54203173463553 |
9 | 11682043560672 |
10 | 3041271900011 |
11 | a7288377a054 |
12 | 41150398060b |
13 | 190a3825c207 |
14 | a72ac38c759 |
15 | 5419cc1a00b |
hex | 2c419ee676b |
3041271900011 has 4 divisors (see below), whose sum is σ = 3041275388592. Its totient is φ = 3041268411432.
The previous prime is 3041271899977. The next prime is 3041271900059. The reversal of 3041271900011 is 1100091721403.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 3041271900011 - 226 = 3041204791147 is a prime.
It is a super-3 number, since 3×30412719000113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3041271903011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 818570 + ... + 2598576.
It is an arithmetic number, because the mean of its divisors is an integer number (760318847148).
Almost surely, 23041271900011 is an apocalyptic number.
3041271900011 is a deficient number, since it is larger than the sum of its proper divisors (3488581).
3041271900011 is a wasteful number, since it uses less digits than its factorization.
3041271900011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3488580.
The product of its (nonzero) digits is 1512, while the sum is 29.
The spelling of 3041271900011 in words is "three trillion, forty-one billion, two hundred seventy-one million, nine hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •