Base | Representation |
---|---|
bin | 1000110011110011… |
… | …00110011010100000 |
3 | 110012121101100112202 |
4 | 10121321212122200 |
5 | 34141222402443 |
6 | 2101145312332 |
7 | 225126030500 |
oct | 43171463240 |
9 | 13177340482 |
10 | 4729497248 |
11 | 2007750313 |
12 | abba956a8 |
13 | 5a4abaca8 |
14 | 32c1a9a00 |
15 | 1ca3227b8 |
hex | 119e666a0 |
4729497248 has 72 divisors (see below), whose sum is σ = 11204997300. Its totient is φ = 1957014528.
The previous prime is 4729497137. The next prime is 4729497251. The reversal of 4729497248 is 8427949274.
It can be written as a sum of positive squares in 2 ways, for example, as 4407366544 + 322130704 = 66388^2 + 17948^2 .
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a junction number, because it is equal to n+sod(n) for n = 4729497193 and 4729497202.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6533 + ... + 97476.
Almost surely, 24729497248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4729497248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5602498650).
4729497248 is an abundant number, since it is smaller than the sum of its proper divisors (6475500052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4729497248 is a wasteful number, since it uses less digits than its factorization.
4729497248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104062 (or 104047 counting only the distinct ones).
The product of its digits is 8128512, while the sum is 56.
The square root of 4729497248 is about 68771.3403097540. The cubic root of 4729497248 is about 1678.5656275430.
The spelling of 4729497248 in words is "four billion, seven hundred twenty-nine million, four hundred ninety-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •