Base | Representation |
---|---|
bin | 1000101010010100… |
… | …10110101010100000 |
3 | 110000001210122002012 |
4 | 10111022112222200 |
5 | 34010400044404 |
6 | 2045225412052 |
7 | 223142242235 |
oct | 42512265240 |
9 | 13001718065 |
10 | 4650003104 |
11 | 1a7689517a |
12 | a9933a028 |
13 | 5914a6c36 |
14 | 3217d578c |
15 | 1c336da6e |
hex | 115296aa0 |
4650003104 has 36 divisors (see below), whose sum is σ = 9570064266. Its totient is φ = 2223906432.
The previous prime is 4650003097. The next prime is 4650003119. The reversal of 4650003104 is 4013000564.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 2740313104 + 1909690000 = 52348^2 + 43700^2 .
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 4650003104.
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 5 ways as a sum of consecutive naturals, for example, 120419 + ... + 154274.
Almost surely, 24650003104 is an apocalyptic number.
It is an amenable number.
4650003104 is an abundant number, since it is smaller than the sum of its proper divisors (4920061162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4650003104 is a wasteful number, since it uses less digits than its factorization.
4650003104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274749 (or 274718 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 4650003104 is about 68190.9312445577. The cubic root of 4650003104 is about 1669.1079060554.
Adding to 4650003104 its reverse (4013000564), we get a palindrome (8663003668).
The spelling of 4650003104 in words is "four billion, six hundred fifty million, three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •