Base | Representation |
---|---|
bin | 1001111011010… |
… | …00000001110000 |
3 | 12210200020012001 |
4 | 10331220001300 |
5 | 132303413400 |
6 | 12132343344 |
7 | 2030505010 |
oct | 475500160 |
9 | 183606161 |
10 | 83263600 |
11 | 430001a2 |
12 | 23a74b54 |
13 | 14333a04 |
14 | b0b5c40 |
15 | 749aa6a |
hex | 4f68070 |
83263600 has 120 divisors (see below), whose sum is σ = 231378048. Its totient is φ = 28204800.
The previous prime is 83263589. The next prime is 83263627. The reversal of 83263600 is 636238.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 366687 + ... + 366913.
Almost surely, 283263600 is an apocalyptic number.
83263600 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 83263600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115689024).
83263600 is an abundant number, since it is smaller than the sum of its proper divisors (148114448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
83263600 is a wasteful number, since it uses less digits than its factorization.
83263600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383 (or 372 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
The square root of 83263600 is about 9124.8890404213. The cubic root of 83263600 is about 436.6683630129.
Adding to 83263600 its reverse (636238), we get a palindrome (83899838).
The spelling of 83263600 in words is "eighty-three million, two hundred sixty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •