Base | Representation |
---|---|
bin | 101100010000011100111… |
… | …111011100101100001010 |
3 | 101202202012001020101020222 |
4 | 230100130333130230022 |
5 | 344312112222141302 |
6 | 10245055315550042 |
7 | 432504553001042 |
oct | 54203477345412 |
9 | 11682161211228 |
10 | 3041323240202 |
11 | a728aa755765 |
12 | 411518bbb322 |
13 | 190a45a96620 |
14 | a72b5114722 |
15 | 541a24abda2 |
hex | 2c41cfdcb0a |
3041323240202 has 8 divisors (see below), whose sum is σ = 4912906772676. Its totient is φ = 1403687649312.
The previous prime is 3041323240171. The next prime is 3041323240243. The reversal of 3041323240202 is 2020423231403.
3041323240202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 3022865572321 + 18457667881 = 1738639^2 + 135859^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 116973970777 = 3041323240202 / (3 + 0 + 4 + 1 + 3 + 2 + 3 + 2 + 4 + 0 + 2 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58486985363 + ... + 58486985414.
Almost surely, 23041323240202 is an apocalyptic number.
3041323240202 is a deficient number, since it is larger than the sum of its proper divisors (1871583532474).
3041323240202 is a wasteful number, since it uses less digits than its factorization.
3041323240202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116973970792.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 3041323240202 its reverse (2020423231403), we get a palindrome (5061746471605).
The spelling of 3041323240202 in words is "three trillion, forty-one billion, three hundred twenty-three million, two hundred forty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •