Base | Representation |
---|---|
bin | 111011110110100000010101… |
… | …011001100101000011011000 |
3 | 1021112000120110012222000221010 |
4 | 323312200111121211003120 |
5 | 234000231141023223102 |
6 | 2331502200454013520 |
7 | 106305522405126363 |
oct | 7366402531450330 |
9 | 1245016405860833 |
10 | 263230314664152 |
11 | 76967393256180 |
12 | 2563396b9472a0 |
13 | b3b56872b4b14 |
14 | 49005b548d0da |
15 | 2067357d8cd6c |
hex | ef68156650d8 |
263230314664152 has 32 divisors (see below), whose sum is σ = 717900858175680. Its totient is φ = 79766762019360.
The previous prime is 263230314664139. The next prime is 263230314664193. The reversal of 263230314664152 is 251466413032362.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 498542262358 + ... + 498542262885.
It is an arithmetic number, because the mean of its divisors is an integer number (22434401817990).
Almost surely, 2263230314664152 is an apocalyptic number.
263230314664152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
263230314664152 is an abundant number, since it is smaller than the sum of its proper divisors (454670543511528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263230314664152 is a wasteful number, since it uses less digits than its factorization.
263230314664152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 997084525263 (or 997084525259 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 48.
The spelling of 263230314664152 in words is "two hundred sixty-three trillion, two hundred thirty billion, three hundred fourteen million, six hundred sixty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •