Base | Representation |
---|---|
bin | 101101101110000… |
… | …1110100100011001 |
3 | 10221220201200201212 |
4 | 1123130032210121 |
5 | 11120214020421 |
6 | 412121352505 |
7 | 53005600415 |
oct | 13334164431 |
9 | 3856650655 |
10 | 1534126361 |
11 | 717a79929 |
12 | 369938735 |
13 | 1b5ab04a1 |
14 | 107a67d45 |
15 | 8ea3ae5b |
hex | 5b70e919 |
1534126361 has 8 divisors (see below), whose sum is σ = 1590705480. Its totient is φ = 1477792512.
The previous prime is 1534126343. The next prime is 1534126379. The reversal of 1534126361 is 1636214351.
It is an interprime number because it is at equal distance from previous prime (1534126343) and next prime (1534126379).
It can be written as a sum of positive squares in 4 ways, for example, as 296493961 + 1237632400 = 17219^2 + 35180^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1534126361 - 210 = 1534125337 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1534126331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48530 + ... + 73643.
It is an arithmetic number, because the mean of its divisors is an integer number (198838185).
Almost surely, 21534126361 is an apocalyptic number.
It is an amenable number.
1534126361 is a deficient number, since it is larger than the sum of its proper divisors (56579119).
1534126361 is a wasteful number, since it uses less digits than its factorization.
1534126361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122635.
The product of its digits is 12960, while the sum is 32.
The square root of 1534126361 is about 39167.9251556679. The cubic root of 1534126361 is about 1153.3303238605.
The spelling of 1534126361 in words is "one billion, five hundred thirty-four million, one hundred twenty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •