Base | Representation |
---|---|
bin | 10011101110001100001000… |
… | …11010000001000010111111 |
3 | 12200112222200202121212100211 |
4 | 21313012010122001002333 |
5 | 21141022200041402010 |
6 | 232123114450333251 |
7 | 12064162004240515 |
oct | 1167060432010277 |
9 | 180488622555324 |
10 | 43368506200255 |
11 | 12900531154275 |
12 | 4a45134b8a227 |
13 | 1b2782ba3c822 |
14 | a9d09299c4b5 |
15 | 5031ab00d08a |
hex | 2771846810bf |
43368506200255 has 24 divisors (see below), whose sum is σ = 55288426141872. Its totient is φ = 32651077911552.
The previous prime is 43368506200207. The next prime is 43368506200259. The reversal of 43368506200255 is 55200260586334.
It is not a de Polignac number, because 43368506200255 - 29 = 43368506199743 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 43368506200199 and 43368506200208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43368506200259) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15286099 + ... + 17899771.
It is an arithmetic number, because the mean of its divisors is an integer number (2303684422578).
Almost surely, 243368506200255 is an apocalyptic number.
43368506200255 is a deficient number, since it is larger than the sum of its proper divisors (11919919941617).
43368506200255 is a wasteful number, since it uses less digits than its factorization.
43368506200255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2625195 (or 2625178 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 49.
Adding to 43368506200255 its reverse (55200260586334), we get a palindrome (98568766786589).
The spelling of 43368506200255 in words is "forty-three trillion, three hundred sixty-eight billion, five hundred six million, two hundred thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •