Base | Representation |
---|---|
bin | 110000110101100111001… |
… | …101010110111010011001 |
3 | 102212211200110011001110220 |
4 | 300311213031112322121 |
5 | 414441243324410040 |
6 | 11045434352030253 |
7 | 464320211632506 |
oct | 60654715267231 |
9 | 12784613131426 |
10 | 3356101013145 |
11 | 108435058a551 |
12 | 462527532389 |
13 | 1b462c3a3c7a |
14 | b8616b504ad |
15 | 5c4771d52d0 |
hex | 30d67356e99 |
3356101013145 has 64 divisors (see below), whose sum is σ = 5509401891840. Its totient is φ = 1743733555200.
The previous prime is 3356101013137. The next prime is 3356101013159. The reversal of 3356101013145 is 5413101016533.
It is a happy number.
It is not a de Polignac number, because 3356101013145 - 23 = 3356101013137 is a prime.
It is a super-2 number, since 2×33561010131452 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 530270341 + ... + 530276669.
It is an arithmetic number, because the mean of its divisors is an integer number (86084404560).
Almost surely, 23356101013145 is an apocalyptic number.
It is an amenable number.
3356101013145 is a deficient number, since it is larger than the sum of its proper divisors (2153300878695).
3356101013145 is a wasteful number, since it uses less digits than its factorization.
3356101013145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9746.
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 3356101013145 its reverse (5413101016533), we get a palindrome (8769202029678).
The spelling of 3356101013145 in words is "three trillion, three hundred fifty-six billion, one hundred one million, thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •