Base | Representation |
---|---|
bin | 1100100101001000010100… |
… | …0010111001010110011111 |
3 | 1210222022212201202101210110 |
4 | 3021102011002321112133 |
5 | 3303110442331301142 |
6 | 45230202334541103 |
7 | 2625221343035430 |
oct | 311220502712637 |
9 | 53868781671713 |
10 | 13832026822047 |
11 | 44531475a4965 |
12 | 16748a5967793 |
13 | 79447bba5865 |
14 | 35b68ba73487 |
15 | 18ec094b299c |
hex | c94850b959f |
13832026822047 has 32 divisors (see below), whose sum is σ = 22480119240192. Its totient is φ = 7384773417984.
The previous prime is 13832026822007. The next prime is 13832026822049. The reversal of 13832026822047 is 74022862023831.
It is not a de Polignac number, because 13832026822047 - 210 = 13832026821023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13832026821987 and 13832026822005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13832026822049) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 141356833 + ... + 141454650.
It is an arithmetic number, because the mean of its divisors is an integer number (702503726256).
Almost surely, 213832026822047 is an apocalyptic number.
13832026822047 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13832026822047 is a deficient number, since it is larger than the sum of its proper divisors (8648092418145).
13832026822047 is a wasteful number, since it uses less digits than its factorization.
13832026822047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282811647.
The product of its (nonzero) digits is 1548288, while the sum is 48.
Adding to 13832026822047 its reverse (74022862023831), we get a palindrome (87854888845878).
The spelling of 13832026822047 in words is "thirteen trillion, eight hundred thirty-two billion, twenty-six million, eight hundred twenty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •