Base | Representation |
---|---|
bin | 101101111011001… |
… | …1000000110001101 |
3 | 10222101121221201022 |
4 | 1123312120012031 |
5 | 11123442344013 |
6 | 412524323525 |
7 | 53121060236 |
oct | 13366300615 |
9 | 3871557638 |
10 | 1540981133 |
11 | 720930a2a |
12 | 3700a35a5 |
13 | 1b7340573 |
14 | 10893008d |
15 | 90442008 |
hex | 5bd9818d |
1540981133 has 4 divisors (see below), whose sum is σ = 1631627100. Its totient is φ = 1450335168.
The previous prime is 1540981103. The next prime is 1540981147. The reversal of 1540981133 is 3311890451.
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 636956644 + 904024489 = 25238^2 + 30067^2 .
It is a cyclic number.
It is not a de Polignac number, because 1540981133 - 28 = 1540980877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1540981093 and 1540981102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540981103) 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, 45322958 + ... + 45322991.
It is an arithmetic number, because the mean of its divisors is an integer number (407906775).
Almost surely, 21540981133 is an apocalyptic number.
It is an amenable number.
1540981133 is a deficient number, since it is larger than the sum of its proper divisors (90645967).
1540981133 is an equidigital number, since it uses as much as digits as its factorization.
1540981133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90645966.
The product of its (nonzero) digits is 12960, while the sum is 35.
The square root of 1540981133 is about 39255.3325422165. The cubic root of 1540981133 is about 1155.0455390801.
The spelling of 1540981133 in words is "one billion, five hundred forty million, nine hundred eighty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •