Base | Representation |
---|---|
bin | 110000011101101111101… |
… | …011100101011111100101 |
3 | 102210101112102011221021002 |
4 | 300131233223211133211 |
5 | 414031302134214031 |
6 | 11025555350203045 |
7 | 462422143251656 |
oct | 60355753453745 |
9 | 12711472157232 |
10 | 3330473351141 |
11 | 107449a4217a2 |
12 | 459574953485 |
13 | 1b20a6b08121 |
14 | b72a529d52d |
15 | 5b97737dccb |
hex | 3076fae57e5 |
3330473351141 has 2 divisors, whose sum is σ = 3330473351142. Its totient is φ = 3330473351140.
The previous prime is 3330473351137. The next prime is 3330473351173. The reversal of 3330473351141 is 1411533740333.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3318864150625 + 11609200516 = 1821775^2 + 107746^2 .
It is a cyclic number.
It is not a de Polignac number, because 3330473351141 - 22 = 3330473351137 is a prime.
It is a super-2 number, since 2×33304733511412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3330473351095 and 3330473351104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3330473321141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1665236675570 + 1665236675571.
It is an arithmetic number, because the mean of its divisors is an integer number (1665236675571).
Almost surely, 23330473351141 is an apocalyptic number.
It is an amenable number.
3330473351141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3330473351141 is an equidigital number, since it uses as much as digits as its factorization.
3330473351141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 136080, while the sum is 38.
The spelling of 3330473351141 in words is "three trillion, three hundred thirty billion, four hundred seventy-three million, three hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •