Base | Representation |
---|---|
bin | 101011100010111… |
… | …0000001000001010 |
3 | 10202211100212120112 |
4 | 1113011300020022 |
5 | 10443022010032 |
6 | 400552554322 |
7 | 51131235344 |
oct | 12705601012 |
9 | 3684325515 |
10 | 1461125642 |
11 | 68a849359 |
12 | 3493b29a2 |
13 | 1a3930bb2 |
14 | dc0a4294 |
15 | 8841b1b2 |
hex | 5717020a |
1461125642 has 8 divisors (see below), whose sum is σ = 2200783332. Its totient is φ = 727531200.
The previous prime is 1461125641. The next prime is 1461125689. The reversal of 1461125642 is 2465211641.
It can be written as a sum of positive squares in 2 ways, for example, as 1386147361 + 74978281 = 37231^2 + 8659^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1461125599 and 1461125608.
It is not an unprimeable number, because it can be changed into a prime (1461125641) 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, 1515209 + ... + 1516172.
Almost surely, 21461125642 is an apocalyptic number.
1461125642 is a deficient number, since it is larger than the sum of its proper divisors (739657690).
1461125642 is a wasteful number, since it uses less digits than its factorization.
1461125642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3031624.
The product of its digits is 11520, while the sum is 32.
The square root of 1461125642 is about 38224.6732098523. The cubic root of 1461125642 is about 1134.7386674104.
The spelling of 1461125642 in words is "one billion, four hundred sixty-one million, one hundred twenty-five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •