Base | Representation |
---|---|
bin | 1111111000111011… |
… | …1100110100000000 |
3 | 102000020222022111002 |
4 | 3332032330310000 |
5 | 32213411110333 |
6 | 1543124511132 |
7 | 210461503112 |
oct | 37616746400 |
9 | 12006868432 |
10 | 4265331968 |
11 | 189973a047 |
12 | 9b054b4a8 |
13 | 52c8a1891 |
14 | 2c66a13b2 |
15 | 19e6d70e8 |
hex | fe3bcd00 |
4265331968 has 72 divisors (see below), whose sum is σ = 9073790208. Its totient is φ = 1996408832.
The previous prime is 4265331923. The next prime is 4265332007. The reversal of 4265331968 is 8691335624.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269030 + ... + 284442.
It is an arithmetic number, because the mean of its divisors is an integer number (126024864).
Almost surely, 24265331968 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 4265331968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4536895104).
4265331968 is an abundant number, since it is smaller than the sum of its proper divisors (4808458240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4265331968 is a wasteful number, since it uses less digits than its factorization.
4265331968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15499 (or 15485 counting only the distinct ones).
The product of its digits is 933120, while the sum is 47.
The square root of 4265331968 is about 65309.5090166815. The cubic root of 4265331968 is about 1621.7513914545.
The spelling of 4265331968 in words is "four billion, two hundred sixty-five million, three hundred thirty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •