Base | Representation |
---|---|
bin | 11001100111101101101011… |
… | …00111101100101011101101 |
3 | 21101111001201202010210010222 |
4 | 30303312311213230223231 |
5 | 24341034043033314430 |
6 | 315454144433141125 |
7 | 14603304006546065 |
oct | 1463666547545355 |
9 | 241431652123128 |
10 | 56340133104365 |
11 | 16a51797398090 |
12 | 639b1186ba7a5 |
13 | 2558b0c3c86b6 |
14 | dcac3c6743a5 |
15 | 67a8097d19e5 |
hex | 333db59ecaed |
56340133104365 has 32 divisors (see below), whose sum is σ = 73863754329600. Its totient is φ = 40913876024320.
The previous prime is 56340133104347. The next prime is 56340133104377.
It is a happy number.
56340133104365 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56340133104365 - 28 = 56340133104109 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 470881589 + ... + 471001221.
It is an arithmetic number, because the mean of its divisors is an integer number (2308242322800).
Almost surely, 256340133104365 is an apocalyptic number.
56340133104365 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56340133104365 is a deficient number, since it is larger than the sum of its proper divisors (17523621225235).
56340133104365 is a wasteful number, since it uses less digits than its factorization.
56340133104365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132277.
The product of its (nonzero) digits is 1166400, while the sum is 44.
It can be divided in two parts, 5634013 and 3104365, that added together give a palindrome (8738378).
The spelling of 56340133104365 in words is "fifty-six trillion, three hundred forty billion, one hundred thirty-three million, one hundred four thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •