Base | Representation |
---|---|
bin | 100111000100001000111… |
… | …1111110011010100100111 |
3 | 201000021100121112010120220 |
4 | 1032020101333303110213 |
5 | 1200431213312323314 |
6 | 15230253432055423 |
7 | 1062620046000303 |
oct | 116102177632447 |
9 | 21007317463526 |
10 | 5369011057959 |
11 | 178aa9185505a |
12 | 728672b34573 |
13 | 2cc3ac4a25c3 |
14 | 147c0c030d03 |
15 | 949d87963a9 |
hex | 4e211ff3527 |
5369011057959 has 4 divisors (see below), whose sum is σ = 7158681410616. Its totient is φ = 3579340705304.
The previous prime is 5369011057951. The next prime is 5369011057967. The reversal of 5369011057959 is 9597501109635.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5369011057951) and next prime (5369011057967).
It is a cyclic number.
It is not a de Polignac number, because 5369011057959 - 23 = 5369011057951 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5369011057951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 894835176324 + ... + 894835176329.
It is an arithmetic number, because the mean of its divisors is an integer number (1789670352654).
Almost surely, 25369011057959 is an apocalyptic number.
5369011057959 is a deficient number, since it is larger than the sum of its proper divisors (1789670352657).
5369011057959 is a wasteful number, since it uses less digits than its factorization.
5369011057959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1789670352656.
The product of its (nonzero) digits is 11481750, while the sum is 60.
The spelling of 5369011057959 in words is "five trillion, three hundred sixty-nine billion, eleven million, fifty-seven thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •