Base | Representation |
---|---|
bin | 110000100000010100000… |
… | …100010111110010001101 |
3 | 102210122122121202212100001 |
4 | 300200110010113302031 |
5 | 414102424203441023 |
6 | 11031133151004301 |
7 | 462550402450141 |
oct | 60402404276215 |
9 | 12718577685301 |
10 | 3333231312013 |
11 | 10756851a65a9 |
12 | 45a004509691 |
13 | 1b2426306635 |
14 | b748769d221 |
15 | 5ba895626ad |
hex | 30814117c8d |
3333231312013 has 2 divisors, whose sum is σ = 3333231312014. Its totient is φ = 3333231312012.
The previous prime is 3333231312007. The next prime is 3333231312067. The reversal of 3333231312013 is 3102131323333.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1938323864169 + 1394907447844 = 1392237^2 + 1181062^2 .
It is a cyclic number.
It is not a de Polignac number, because 3333231312013 - 25 = 3333231311981 is a prime.
It is a super-2 number, since 2×33332313120132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3333231312113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1666615656006 + 1666615656007.
It is an arithmetic number, because the mean of its divisors is an integer number (1666615656007).
Almost surely, 23333231312013 is an apocalyptic number.
It is an amenable number.
3333231312013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3333231312013 is an equidigital number, since it uses as much as digits as its factorization.
3333231312013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 3333231312013 its reverse (3102131323333), we get a palindrome (6435362635346).
The spelling of 3333231312013 in words is "three trillion, three hundred thirty-three billion, two hundred thirty-one million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •