13469256059 has 16 divisors (see below), whose sum is σ = 15758856960. Its totient is φ = 11271264480.

The previous prime is 13469256049. The next prime is 13469256109. The reversal of 13469256059 is 95065296431.

13469256059 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 13469256059 - 2⁸ = 13469255803 is a prime.

It is a super-2 number, since 2×13469256059² (a number of 21 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 13469255998 and 13469256016.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 709724 + ... + 728454.

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

Almost surely, 2^13469256059 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21170.

The product of its (nonzero) digits is 1749600, while the sum is 50.

The spelling of 13469256059 in words is "thirteen billion, four hundred sixty-nine million, two hundred fifty-six thousand, fifty-nine".