Base | Representation |
---|---|
bin | 1000110111110011… |
… | …10100111010000000 |
3 | 110021221122010000000 |
4 | 10123321310322000 |
5 | 34223324023130 |
6 | 2104350000000 |
7 | 226014530052 |
oct | 43371647200 |
9 | 13257563000 |
10 | 4763111040 |
11 | 2024719906 |
12 | b0b1a6000 |
13 | 5aba59acc |
14 | 3328398d2 |
15 | 1cd262260 |
hex | 11be74e80 |
4763111040 has 512 divisors, whose sum is σ = 17704915200. Its totient is φ = 1224253440.
The previous prime is 4763111021. The next prime is 4763111069. The reversal of 4763111040 is 401113674.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 4763110995 and 4763111013.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57386839 + ... + 57386921.
Almost surely, 24763111040 is an apocalyptic number.
4763111040 is a gapful number since it is divisible by the number (40) 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 4763111040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8852457600).
4763111040 is an abundant number, since it is smaller than the sum of its proper divisors (12941804160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4763111040 is an frugal number, since it uses more digits than its factorization.
4763111040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 4763111040 is about 69015.2956959542. The cubic root of 4763111040 is about 1682.5329139336.
The spelling of 4763111040 in words is "four billion, seven hundred sixty-three million, one hundred eleven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •