Base | Representation |
---|---|
bin | 1111111000000001… |
… | …1011011000100110 |
3 | 101222222210220100101 |
4 | 3332000123120212 |
5 | 32211422300110 |
6 | 1542511134314 |
7 | 210414236140 |
oct | 37600333046 |
9 | 11888726311 |
10 | 4261525030 |
11 | 1897579914 |
12 | 9ab21439a |
13 | 52bb6ab59 |
14 | 2c5d8dc90 |
15 | 19e1d413a |
hex | fe01b626 |
4261525030 has 16 divisors (see below), whose sum is σ = 8766565920. Its totient is φ = 1461094272.
The previous prime is 4261525027. The next prime is 4261525033. The reversal of 4261525030 is 305251624.
4261525030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (4261525027) and next prime (4261525033).
It is a self number, because there is not a number n which added to its sum of digits gives 4261525030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4261525033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30439395 + ... + 30439534.
It is an arithmetic number, because the mean of its divisors is an integer number (547910370).
Almost surely, 24261525030 is an apocalyptic number.
4261525030 is an abundant number, since it is smaller than the sum of its proper divisors (4505040890).
4261525030 is a wasteful number, since it uses less digits than its factorization.
4261525030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60878943.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 4261525030 is about 65280.3571528220. The cubic root of 4261525030 is about 1621.2687604224.
Adding to 4261525030 its reverse (305251624), we get a palindrome (4566776654).
The spelling of 4261525030 in words is "four billion, two hundred sixty-one million, five hundred twenty-five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •