Base | Representation |
---|---|
bin | 1011000000000110… |
… | …11111111001110101 |
3 | 120020122010010212101 |
4 | 11200003133321311 |
5 | 44044030402031 |
6 | 2414032422101 |
7 | 266240253166 |
oct | 54003377165 |
9 | 16218103771 |
10 | 5906497141 |
11 | 25610777a6 |
12 | 118a0a7931 |
13 | 7318bb62c |
14 | 40062d76d |
15 | 248818361 |
hex | 1600dfe75 |
5906497141 has 4 divisors (see below), whose sum is σ = 5914555852. Its totient is φ = 5898438432.
The previous prime is 5906497061. The next prime is 5906497147. The reversal of 5906497141 is 1417946095.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4296802500 + 1609694641 = 65550^2 + 40121^2 .
It is a cyclic number.
It is not a de Polignac number, because 5906497141 - 27 = 5906497013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5906497091 and 5906497100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5906497147) 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, 4028256 + ... + 4029721.
It is an arithmetic number, because the mean of its divisors is an integer number (1478638963).
Almost surely, 25906497141 is an apocalyptic number.
It is an amenable number.
5906497141 is a deficient number, since it is larger than the sum of its proper divisors (8058711).
5906497141 is an equidigital number, since it uses as much as digits as its factorization.
5906497141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8058710.
The product of its (nonzero) digits is 272160, while the sum is 46.
The square root of 5906497141 is about 76853.7386273433. The cubic root of 5906497141 is about 1807.6319102652.
The spelling of 5906497141 in words is "five billion, nine hundred six million, four hundred ninety-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •