Base | Representation |
---|---|
bin | 1111110111111010… |
… | …0111100000111111 |
3 | 101222221220210022122 |
4 | 3331332213200333 |
5 | 32211312103211 |
6 | 1542453033155 |
7 | 210410221361 |
oct | 37576474077 |
9 | 11887823278 |
10 | 4261050431 |
11 | 1897285290 |
12 | 9ab0257bb |
13 | 52ba32b21 |
14 | 2c5ca8d31 |
15 | 19e13d6db |
hex | fdfa783f |
4261050431 has 16 divisors (see below), whose sum is σ = 4708948608. Its totient is φ = 3823332000.
The previous prime is 4261050341. The next prime is 4261050433. The reversal of 4261050431 is 1340501624.
It is a cyclic number.
It is not a de Polignac number, because 4261050431 - 210 = 4261049407 is a prime.
It is a super-2 number, since 2×42610504312 = 36313101551050571522, 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 4261050431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4261050433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1493156 + ... + 1496006.
It is an arithmetic number, because the mean of its divisors is an integer number (294309288).
Almost surely, 24261050431 is an apocalyptic number.
4261050431 is a deficient number, since it is larger than the sum of its proper divisors (447898177).
4261050431 is a wasteful number, since it uses less digits than its factorization.
4261050431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4582.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 4261050431 is about 65276.7219688612. The cubic root of 4261050431 is about 1621.2085721805.
The spelling of 4261050431 in words is "four billion, two hundred sixty-one million, fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •