Base | Representation |
---|---|
bin | 110001100100010101… |
… | …101000011111000000 |
3 | 12002101012110112110020 |
4 | 301210111220133000 |
5 | 1333000042000000 |
6 | 40241133333440 |
7 | 3562626015132 |
oct | 614425503700 |
9 | 162335415406 |
10 | 53223000000 |
11 | 20631aa5715 |
12 | a394337280 |
13 | 5032702311 |
14 | 280c7c5052 |
15 | 15b77d7ba0 |
hex | c645687c0 |
53223000000 has 392 divisors, whose sum is σ = 178710524976. Its totient is φ = 13977600000.
The previous prime is 53222999989. The next prime is 53223000001. The reversal of 53223000000 is 32235.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53223000001) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 338999922 + ... + 339000078.
Almost surely, 253223000000 is an apocalyptic number.
53223000000 is a gapful number since it is divisible by the number (50) 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 53223000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89355262488).
53223000000 is an abundant number, since it is smaller than the sum of its proper divisors (125487524976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53223000000 is an equidigital number, since it uses as much as digits as its factorization.
53223000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315 (or 280 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 15.
Adding to 53223000000 its reverse (32235), we get a palindrome (53223032235).
The spelling of 53223000000 in words is "fifty-three billion, two hundred twenty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •