Base | Representation |
---|---|
bin | 10101010001000000101… |
… | …011110110000010110101 |
3 | 12011201001200012221001001 |
4 | 111101000223312002311 |
5 | 142420343233203041 |
6 | 3035202423003301 |
7 | 210403133013631 |
oct | 25210053660265 |
9 | 5151050187031 |
10 | 1461374116021 |
11 | 513846655026 |
12 | 1b7283299531 |
13 | a7a64c4c161 |
14 | 50a33793dc1 |
15 | 28031343131 |
hex | 15440af60b5 |
1461374116021 has 8 divisors (see below), whose sum is σ = 1540954566080. Its totient is φ = 1382060268288.
The previous prime is 1461374116019. The next prime is 1461374116031. The reversal of 1461374116021 is 1206114731641.
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 1461374116021 - 21 = 1461374116019 is a prime.
It is a super-2 number, since 2×14613741160212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1461374116031) 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, 66639321 + ... + 66661246.
It is an arithmetic number, because the mean of its divisors is an integer number (192619320760).
Almost surely, 21461374116021 is an apocalyptic number.
It is an amenable number.
1461374116021 is a deficient number, since it is larger than the sum of its proper divisors (79580450059).
1461374116021 is a wasteful number, since it uses less digits than its factorization.
1461374116021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133301163.
The product of its (nonzero) digits is 24192, while the sum is 37.
Adding to 1461374116021 its reverse (1206114731641), we get a palindrome (2667488847662).
The spelling of 1461374116021 in words is "one trillion, four hundred sixty-one billion, three hundred seventy-four million, one hundred sixteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •