Base | Representation |
---|---|
bin | 10101010001000000000… |
… | …110100011101000001101 |
3 | 12011201000222211022120220 |
4 | 111101000012203220031 |
5 | 142420333232410021 |
6 | 3035201433301553 |
7 | 210402653643036 |
oct | 25210006435015 |
9 | 5151028738526 |
10 | 1461364341261 |
11 | 513841089110 |
12 | 1b727bb648b9 |
13 | a7a62c08c86 |
14 | 50a3236ba8d |
15 | 28030561cc6 |
hex | 154401a3a0d |
1461364341261 has 32 divisors (see below), whose sum is σ = 2135054256768. Its totient is φ = 881748541440.
The previous prime is 1461364341259. The next prime is 1461364341317. The reversal of 1461364341261 is 1621434631641.
It is not a de Polignac number, because 1461364341261 - 21 = 1461364341259 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461364341211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15838915 + ... + 15930911.
It is an arithmetic number, because the mean of its divisors is an integer number (66720445524).
Almost surely, 21461364341261 is an apocalyptic number.
1461364341261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1461364341261 is a deficient number, since it is larger than the sum of its proper divisors (673689915507).
1461364341261 is a wasteful number, since it uses less digits than its factorization.
1461364341261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94141.
The product of its digits is 248832, while the sum is 42.
The spelling of 1461364341261 in words is "one trillion, four hundred sixty-one billion, three hundred sixty-four million, three hundred forty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •