Base | Representation |
---|---|
bin | 1000101101000010… |
… | …11010110100010000 |
3 | 110001122202012002100 |
4 | 10112201122310100 |
5 | 34032220423030 |
6 | 2051402520400 |
7 | 223540241166 |
oct | 42641326420 |
9 | 13048665070 |
10 | 4672826640 |
11 | 1a887638a9 |
12 | aa4b06100 |
13 | 5961385a1 |
14 | 324857236 |
15 | 1c537b360 |
hex | 11685ad10 |
4672826640 has 60 divisors (see below), whose sum is σ = 15692911884. Its totient is φ = 1246086912.
The previous prime is 4672826629. The next prime is 4672826677. The reversal of 4672826640 is 466282764.
It can be written as a sum of positive squares in 2 ways, for example, as 3604321296 + 1068505344 = 60036^2 + 32688^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3244299 + ... + 3245738.
Almost surely, 24672826640 is an apocalyptic number.
4672826640 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4672826640 is an abundant number, since it is smaller than the sum of its proper divisors (11020085244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4672826640 is a wasteful number, since it uses less digits than its factorization.
4672826640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6490056 (or 6490047 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 45.
The square root of 4672826640 is about 68358.0766259555. The cubic root of 4672826640 is about 1671.8342688840.
The spelling of 4672826640 in words is "four billion, six hundred seventy-two million, eight hundred twenty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •