Base | Representation |
---|---|
bin | 101000010111011… |
… | …0010001101000101 |
3 | 10111101121202111112 |
4 | 1100232302031011 |
5 | 10233214112131 |
6 | 342222214405 |
7 | 45364364105 |
oct | 12056621505 |
9 | 3441552445 |
10 | 1354441541 |
11 | 635601a82 |
12 | 319724405 |
13 | 1877b9bcb |
14 | cbc53205 |
15 | 7dd9602b |
hex | 50bb2345 |
1354441541 has 4 divisors (see below), whose sum is σ = 1354517472. Its totient is φ = 1354365612.
The previous prime is 1354441531. The next prime is 1354441577. The reversal of 1354441541 is 1451444531.
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 1354441541 - 230 = 280699717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1354441498 and 1354441507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1354441531) 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, 5000 + ... + 52286.
It is an arithmetic number, because the mean of its divisors is an integer number (338629368).
Almost surely, 21354441541 is an apocalyptic number.
It is an amenable number.
1354441541 is a deficient number, since it is larger than the sum of its proper divisors (75931).
1354441541 is an equidigital number, since it uses as much as digits as its factorization.
1354441541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75930.
The product of its digits is 19200, while the sum is 32.
The square root of 1354441541 is about 36802.7382269309. The cubic root of 1354441541 is about 1106.4201803326.
The spelling of 1354441541 in words is "one billion, three hundred fifty-four million, four hundred forty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •