Search a number
-
+
48267056064 = 2631759263953
BaseRepresentation
bin101100111100111100…
…001101001111000000
311121120210222111110010
4230330330031033000
51242322331243224
634101254304520
73326050131033
oct547474151700
9147523874403
1048267056064
1119519549687
129430658140
134722a2a506
14249c51101a
1513c7684e29
hexb3cf0d3c0

48267056064 has 224 divisors, whose sum is σ = 138178275840. Its totient is φ = 14813790208.

The previous prime is 48267056041. The next prime is 48267056069. The reversal of 48267056064 is 46065076284.

48267056064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (48).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (48267056069) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50647012 + ... + 50647964.

Almost surely, 248267056064 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 48267056064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69089137920).

48267056064 is an abundant number, since it is smaller than the sum of its proper divisors (89911219776).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

48267056064 is a wasteful number, since it uses less digits than its factorization.

48267056064 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1307 (or 1297 counting only the distinct ones).

The product of its (nonzero) digits is 1935360, while the sum is 48.

The spelling of 48267056064 in words is "forty-eight billion, two hundred sixty-seven million, fifty-six thousand, sixty-four".