Base | Representation |
---|---|
bin | 110000110000111101010… |
… | …100011000111100111101 |
3 | 102212100210010222012000021 |
4 | 300300331110120330331 |
5 | 414401024412334031 |
6 | 11043250420332141 |
7 | 464052314415310 |
oct | 60607524307475 |
9 | 12770703865007 |
10 | 3351103246141 |
11 | 10822164681a2 |
12 | 461571844051 |
13 | 1b4013b478a1 |
14 | b82a10b0977 |
15 | 5c283570511 |
hex | 30c3d518f3d |
3351103246141 has 16 divisors (see below), whose sum is σ = 3836381792256. Its totient is φ = 2867463544176.
The previous prime is 3351103246109. The next prime is 3351103246157. The reversal of 3351103246141 is 1416423011533.
It is not a de Polignac number, because 3351103246141 - 25 = 3351103246109 is a prime.
It is a super-2 number, since 2×33511032461412 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3351103246097 and 3351103246106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3351103246541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29050320 + ... + 29165446.
It is an arithmetic number, because the mean of its divisors is an integer number (239773862016).
Almost surely, 23351103246141 is an apocalyptic number.
It is an amenable number.
3351103246141 is a deficient number, since it is larger than the sum of its proper divisors (485278546115).
3351103246141 is a wasteful number, since it uses less digits than its factorization.
3351103246141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122208.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 3351103246141 its reverse (1416423011533), we get a palindrome (4767526257674).
The spelling of 3351103246141 in words is "three trillion, three hundred fifty-one billion, one hundred three million, two hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •