Search a number
-
+
135116669013969 = 3433910380016057
BaseRepresentation
bin11110101110001101001101…
…000011110100111111010001
3122201102000201222110101212110
4132232031031003310333101
5120202222414231421334
61155211424004215533
740313600005550526
oct3656151503647721
9581360658411773
10135116669013969
113a0637261a0795
12131a262309a5a9
135a515a76c2756
14255197872714d
151094a645ebae9
hex7ae34d0f4fd1

135116669013969 has 8 divisors (see below), whose sum is σ = 180197078766880. Its totient is φ = 90057019301856.

The previous prime is 135116669013959. The next prime is 135116669014001. The reversal of 135116669013969 is 969310966611531.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 135116669013969 - 27 = 135116669013841 is a prime.

It is a super-2 number, since 2×1351166690139692 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (135116669013959) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5189995012 + ... + 5190021045.

It is an arithmetic number, because the mean of its divisors is an integer number (22524634845860).

Almost surely, 2135116669013969 is an apocalyptic number.

It is an amenable number.

135116669013969 is a deficient number, since it is larger than the sum of its proper divisors (45080409752911).

135116669013969 is a wasteful number, since it uses less digits than its factorization.

135116669013969 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 10380020399.

The product of its (nonzero) digits is 42515280, while the sum is 66.

The spelling of 135116669013969 in words is "one hundred thirty-five trillion, one hundred sixteen billion, six hundred sixty-nine million, thirteen thousand, nine hundred sixty-nine".

Divisors: 1 3 4339 13017 10380016057 31140048171 45038889671323 135116669013969