Base | Representation |
---|---|
bin | 1000111101100011… |
… | …00010111111000000 |
3 | 110102022020221121000 |
4 | 10132301202333000 |
5 | 34323141202003 |
6 | 2113230132000 |
7 | 230141065305 |
oct | 43661427700 |
9 | 13368227530 |
10 | 4811272128 |
11 | 2049923a63 |
12 | b23351000 |
13 | 5b8a201b0 |
14 | 338db50ac |
15 | 1d25c71a3 |
hex | 11ec62fc0 |
4811272128 has 112 divisors (see below), whose sum is σ = 15232339360. Its totient is φ = 1480384512.
The previous prime is 4811272127. The next prime is 4811272157. The reversal of 4811272128 is 8212721184.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 4811272092 and 4811272101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4811272127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84625 + ... + 129552.
It is an arithmetic number, because the mean of its divisors is an integer number (136003030).
Almost surely, 24811272128 is an apocalyptic number.
4811272128 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4811272128 is an abundant number, since it is smaller than the sum of its proper divisors (10421067232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4811272128 is a wasteful number, since it uses less digits than its factorization.
4811272128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214211 (or 214195 counting only the distinct ones).
The product of its digits is 14336, while the sum is 36.
The square root of 4811272128 is about 69363.3341759175. The cubic root of 4811272128 is about 1688.1847540041.
The spelling of 4811272128 in words is "four billion, eight hundred eleven million, two hundred seventy-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •