Base | Representation |
---|---|
bin | 1001010110111001… |
… | …01111111000100110 |
3 | 110222010101202210000 |
4 | 10223130233320212 |
5 | 40242111030000 |
6 | 2150304042130 |
7 | 235332435006 |
oct | 45334577046 |
9 | 13863352700 |
10 | 5023923750 |
11 | 21489682aa |
12 | b82603346 |
13 | 620ab6c61 |
14 | 35932c006 |
15 | 1e60d0000 |
hex | 12b72fe26 |
5023923750 has 300 divisors, whose sum is σ = 14815866780. Its totient is φ = 1271592000.
The previous prime is 5023923743. The next prime is 5023923769. The reversal of 5023923750 is 573293205.
5023923750 is a `hidden beast` number, since 50 + 239 + 2 + 375 + 0 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 149 ways as a sum of consecutive naturals, for example, 85151221 + ... + 85151279.
Almost surely, 25023923750 is an apocalyptic number.
5023923750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5023923750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7407933390).
5023923750 is an abundant number, since it is smaller than the sum of its proper divisors (9791943030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5023923750 is an equidigital number, since it uses as much as digits as its factorization.
5023923750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151 (or 98 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 36.
The square root of 5023923750 is about 70879.6427050814. The cubic root of 5023923750 is about 1712.6988775724.
The spelling of 5023923750 in words is "five billion, twenty-three million, nine hundred twenty-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •