Base | Representation |
---|---|
bin | 101111000110110101… |
… | …000000000101011000 |
3 | 11211120000222201022000 |
4 | 233012311000011120 |
5 | 1312042042014000 |
6 | 35123014001000 |
7 | 3440300334042 |
oct | 570665000530 |
9 | 154500881260 |
10 | 50580423000 |
11 | 1a4a636a488 |
12 | 9977346160 |
13 | 4a010a28a3 |
14 | 263b85ca92 |
15 | 14b07e7000 |
hex | bc6d40158 |
50580423000 has 512 divisors, whose sum is σ = 186810624000. Its totient is φ = 12616243200.
The previous prime is 50580422989. The next prime is 50580423037. The reversal of 50580423000 is 32408505.
50580423000 is a `hidden beast` number, since 50 + 580 + 4 + 2 + 30 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 120716791 + ... + 120717209.
It is an arithmetic number, because the mean of its divisors is an integer number (364864500).
Almost surely, 250580423000 is an apocalyptic number.
50580423000 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 50580423000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93405312000).
50580423000 is an abundant number, since it is smaller than the sum of its proper divisors (136230201000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50580423000 is a wasteful number, since it uses less digits than its factorization.
50580423000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729 (or 709 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 50580423000 in words is "fifty billion, five hundred eighty million, four hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •