Base | Representation |
---|---|
bin | 111101111111110… |
… | …111010000000010 |
3 | 2200111020011200122 |
4 | 331333313100002 |
5 | 4112234322204 |
6 | 251114020242 |
7 | 34530066551 |
oct | 7577672002 |
9 | 2614204618 |
10 | 1040151554 |
11 | 494158292 |
12 | 250417682 |
13 | 1376579c0 |
14 | 9c1ddd98 |
15 | 614b30be |
hex | 3dff7402 |
1040151554 has 8 divisors (see below), whose sum is σ = 1680244860. Its totient is φ = 480069936.
The previous prime is 1040151551. The next prime is 1040151569. The reversal of 1040151554 is 4551510401.
It can be written as a sum of positive squares in 2 ways, for example, as 896703025 + 143448529 = 29945^2 + 11977^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10401515542 = 2163830510577229832, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 40005829 = 1040151554 / (1 + 0 + 4 + 0 + 1 + 5 + 1 + 5 + 5 + 4).
It is not an unprimeable number, because it can be changed into a prime (1040151551) 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, 20002889 + ... + 20002940.
Almost surely, 21040151554 is an apocalyptic number.
1040151554 is a deficient number, since it is larger than the sum of its proper divisors (640093306).
1040151554 is a wasteful number, since it uses less digits than its factorization.
1040151554 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40005844.
The product of its (nonzero) digits is 2000, while the sum is 26.
The square root of 1040151554 is about 32251.3806526170. The cubic root of 1040151554 is about 1013.2086156478.
Adding to 1040151554 its reverse (4551510401), we get a palindrome (5591661955).
The spelling of 1040151554 in words is "one billion, forty million, one hundred fifty-one thousand, five hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •