Base | Representation |
---|---|
bin | 101100010000001111110… |
… | …000011011111100111011 |
3 | 101202201121120102122000122 |
4 | 230100033300123330323 |
5 | 344311133401414321 |
6 | 10245021304523455 |
7 | 432466215463043 |
oct | 54201760337473 |
9 | 11681546378018 |
10 | 3041101201211 |
11 | a727a638a567 |
12 | 41147678058b |
13 | 190a0ba93ac8 |
14 | a7293836723 |
15 | 5418cc4c8ab |
hex | 2c40fc1bf3b |
3041101201211 has 8 divisors (see below), whose sum is σ = 3173383142304. Its totient is φ = 2908824272640.
The previous prime is 3041101201181. The next prime is 3041101201217. The reversal of 3041101201211 is 1121021011403.
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 3041101201211 - 26 = 3041101201147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3041101201211.
It is not an unprimeable number, because it can be changed into a prime (3041101201217) 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 7 ways as a sum of consecutive naturals, for example, 13931 + ... + 2466251.
It is an arithmetic number, because the mean of its divisors is an integer number (396672892788).
Almost surely, 23041101201211 is an apocalyptic number.
3041101201211 is a deficient number, since it is larger than the sum of its proper divisors (132281941093).
3041101201211 is a wasteful number, since it uses less digits than its factorization.
3041101201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2506261.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 3041101201211 its reverse (1121021011403), we get a palindrome (4162122212614).
The spelling of 3041101201211 in words is "three trillion, forty-one billion, one hundred one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •