Base | Representation |
---|---|
bin | 1101011011101010010… |
… | …1000000101100111100 |
3 | 211001122022021222120222 |
4 | 3112322211000230330 |
5 | 12240100430443233 |
6 | 254002235200512 |
7 | 22446351435650 |
oct | 3267245005474 |
9 | 731568258528 |
10 | 230763531068 |
11 | 89958aa7444 |
12 | 388822a6138 |
13 | 189b79388b5 |
14 | b251ac0a60 |
15 | 600911e898 |
hex | 35ba940b3c |
230763531068 has 12 divisors (see below), whose sum is σ = 461527062192. Its totient is φ = 98898656160.
The previous prime is 230763531043. The next prime is 230763531073. The reversal of 230763531068 is 860135367032.
230763531068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
230763531068 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4120777313 + ... + 4120777368.
It is an arithmetic number, because the mean of its divisors is an integer number (38460588516).
Almost surely, 2230763531068 is an apocalyptic number.
230763531068 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
230763531068 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230763531068 is a wasteful number, since it uses less digits than its factorization.
230763531068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8241554692 (or 8241554690 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 44.
The spelling of 230763531068 in words is "two hundred thirty billion, seven hundred sixty-three million, five hundred thirty-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •