Base | Representation |
---|---|
bin | 1101100100011110101… |
… | …0101010011001111111 |
3 | 211021202021100112211000 |
4 | 3121013222222121333 |
5 | 12304422413200223 |
6 | 255033153501343 |
7 | 22562123255514 |
oct | 3310752523177 |
9 | 737667315730 |
10 | 233130600063 |
11 | 8a963167409 |
12 | 39222b71853 |
13 | 18ca416443a |
14 | b3d820b30b |
15 | 60e6d3d543 |
hex | 3647aaa67f |
233130600063 has 32 divisors (see below), whose sum is σ = 349010723520. Its totient is φ = 153787852800.
The previous prime is 233130600013. The next prime is 233130600071. The reversal of 233130600063 is 360006031332.
233130600063 is a `hidden beast` number, since 23 + 3 + 1 + 30 + 600 + 0 + 6 + 3 = 666.
It is not a de Polignac number, because 233130600063 - 218 = 233130337919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233130600013) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4602531 + ... + 4652907.
It is an arithmetic number, because the mean of its divisors is an integer number (10906585110).
Almost surely, 2233130600063 is an apocalyptic number.
233130600063 is a deficient number, since it is larger than the sum of its proper divisors (115880123457).
233130600063 is a wasteful number, since it uses less digits than its factorization.
233130600063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52184 (or 52178 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 233130600063 its reverse (360006031332), we get a palindrome (593136631395).
The spelling of 233130600063 in words is "two hundred thirty-three billion, one hundred thirty million, six hundred thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •