Base | Representation |
---|---|
bin | 1111010100011110111001… |
… | …11010011100110011010001 |
3 | 11102021122112201200201020110 |
4 | 13222033130322130303101 |
5 | 13403430322002443434 |
6 | 155352324101231533 |
7 | 10044650111040051 |
oct | 752173472346321 |
9 | 142248481621213 |
10 | 33689134812369 |
11 | a809533367113 |
12 | 394121b1025a9 |
13 | 15a4b443c377a |
14 | 8467c456b561 |
15 | 3d64e97b54e9 |
hex | 1ea3dce9ccd1 |
33689134812369 has 4 divisors (see below), whose sum is σ = 44918846416496. Its totient is φ = 22459423208244.
The previous prime is 33689134812287. The next prime is 33689134812373. The reversal of 33689134812369 is 96321843198633.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 33689134812369 - 211 = 33689134810321 is a prime.
It is a super-2 number, since 2×336891348123692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (33689134812169) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5614855802059 + ... + 5614855802064.
It is an arithmetic number, because the mean of its divisors is an integer number (11229711604124).
Almost surely, 233689134812369 is an apocalyptic number.
It is an amenable number.
33689134812369 is a deficient number, since it is larger than the sum of its proper divisors (11229711604127).
33689134812369 is a wasteful number, since it uses less digits than its factorization.
33689134812369 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11229711604126.
The product of its digits is 120932352, while the sum is 66.
The spelling of 33689134812369 in words is "thirty-three trillion, six hundred eighty-nine billion, one hundred thirty-four million, eight hundred twelve thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •