Base | Representation |
---|---|
bin | 1000101000001010… |
… | …11111001011011000 |
3 | 102221210211102221012 |
4 | 10110011133023120 |
5 | 33441234400130 |
6 | 2043342433052 |
7 | 222532632344 |
oct | 42405371330 |
9 | 12853742835 |
10 | 4631950040 |
11 | 1a67684693 |
12 | a93292788 |
13 | 58a825a53 |
14 | 31d256624 |
15 | 1c19a4995 |
hex | 11415f2d8 |
4631950040 has 16 divisors (see below), whose sum is σ = 10421887680. Its totient is φ = 1852780000.
The previous prime is 4631949989. The next prime is 4631950049. The reversal of 4631950040 is 400591364.
It is a super-2 number, since 2×46319500402 = 42909922346112003200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4631949979 and 4631950006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4631950049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57899336 + ... + 57899415.
It is an arithmetic number, because the mean of its divisors is an integer number (651367980).
Almost surely, 24631950040 is an apocalyptic number.
4631950040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4631950040 is an abundant number, since it is smaller than the sum of its proper divisors (5789937640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4631950040 is a wasteful number, since it uses less digits than its factorization.
4631950040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115798762 (or 115798758 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 4631950040 is about 68058.4310721310. The cubic root of 4631950040 is about 1666.9450694037.
The spelling of 4631950040 in words is "four billion, six hundred thirty-one million, nine hundred fifty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •