Base | Representation |
---|---|
bin | 1000010000000110… |
… | …11001010011111011 |
3 | 102102201222010121201 |
4 | 10020003121103323 |
5 | 33033044401011 |
6 | 2011331515031 |
7 | 214532005636 |
oct | 41003312373 |
9 | 12381863551 |
10 | 4430075131 |
11 | 1973731019 |
12 | a37758a77 |
13 | 557a63241 |
14 | 300506c1d |
15 | 1addc9cc1 |
hex | 1080d94fb |
4430075131 has 4 divisors (see below), whose sum is σ = 4663237000. Its totient is φ = 4196913264.
The previous prime is 4430075071. The next prime is 4430075137. The reversal of 4430075131 is 1315700344.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4430075131 - 221 = 4427977979 is a prime.
It is a super-2 number, since 2×44300751312 = 39251131332609334322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4430075131.
It is not an unprimeable number, because it can be changed into a prime (4430075137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116580906 + ... + 116580943.
It is an arithmetic number, because the mean of its divisors is an integer number (1165809250).
Almost surely, 24430075131 is an apocalyptic number.
4430075131 is a deficient number, since it is larger than the sum of its proper divisors (233161869).
4430075131 is a wasteful number, since it uses less digits than its factorization.
4430075131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233161868.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 4430075131 is about 66558.8095671790. The cubic root of 4430075131 is about 1642.3675811720.
Adding to 4430075131 its reverse (1315700344), we get a palindrome (5745775475).
The spelling of 4430075131 in words is "four billion, four hundred thirty million, seventy-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •