Base | Representation |
---|---|
bin | 1000000010011001… |
… | …01001110010001101 |
3 | 102010201112211102111 |
4 | 10001030221302031 |
5 | 32314123431024 |
6 | 1552102424021 |
7 | 211634262622 |
oct | 40114516215 |
9 | 12121484374 |
10 | 4315061389 |
11 | 1914815541 |
12 | a05132011 |
13 | 539c93a82 |
14 | 2cd128349 |
15 | 1a3c5ba94 |
hex | 101329c8d |
4315061389 has 4 divisors (see below), whose sum is σ = 4315193056. Its totient is φ = 4314929724.
The previous prime is 4315061369. The next prime is 4315061407. The reversal of 4315061389 is 9831605134.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 4315061389 - 227 = 4180843661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4315061339) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 26392 + ... + 96574.
It is an arithmetic number, because the mean of its divisors is an integer number (1078798264).
Almost surely, 24315061389 is an apocalyptic number.
It is an amenable number.
4315061389 is a deficient number, since it is larger than the sum of its proper divisors (131667).
4315061389 is an equidigital number, since it uses as much as digits as its factorization.
4315061389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131666.
The product of its (nonzero) digits is 77760, while the sum is 40.
The square root of 4315061389 is about 65689.1268704342. The cubic root of 4315061389 is about 1628.0297104984.
The spelling of 4315061389 in words is "four billion, three hundred fifteen million, sixty-one thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •