Base | Representation |
---|---|
bin | 1110001001101010111… |
… | …0001000011001101011 |
3 | 212020112000210102021212 |
4 | 3202122232020121223 |
5 | 12440344132443000 |
6 | 303403543423335 |
7 | 23364406334423 |
oct | 3423256103153 |
9 | 766460712255 |
10 | 243113952875 |
11 | 94116541112 |
12 | 3b14a454b4b |
13 | 19c055735b1 |
14 | baa4079483 |
15 | 64cd50dc35 |
hex | 389ab8866b |
243113952875 has 16 divisors (see below), whose sum is σ = 311606387040. Its totient is φ = 189234640800.
The previous prime is 243113952871. The next prime is 243113952877. The reversal of 243113952875 is 578259311342.
243113952875 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 243113952875 - 22 = 243113952871 is a prime.
It is not an unprimeable number, because it can be changed into a prime (243113952871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26277965 + ... + 26287214.
It is an arithmetic number, because the mean of its divisors is an integer number (19475399190).
Almost surely, 2243113952875 is an apocalyptic number.
243113952875 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
243113952875 is a deficient number, since it is larger than the sum of its proper divisors (68492434165).
243113952875 is an equidigital number, since it uses as much as digits as its factorization.
243113952875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52565231 (or 52565221 counting only the distinct ones).
The product of its digits is 1814400, while the sum is 50.
The spelling of 243113952875 in words is "two hundred forty-three billion, one hundred thirteen million, nine hundred fifty-two thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •