Base | Representation |
---|---|
bin | 10101000111101010000… |
… | …110101111110111011101 |
3 | 12010202010210111002011000 |
4 | 111013222012233313131 |
5 | 142234311343204341 |
6 | 3030422121220513 |
7 | 206566231122564 |
oct | 25075206576735 |
9 | 5122123432130 |
10 | 1451331616221 |
11 | 50a562952313 |
12 | 1b5340031739 |
13 | a6b24501396 |
14 | 5035db2abdb |
15 | 27b4488c8b6 |
hex | 151ea1afddd |
1451331616221 has 64 divisors (see below), whose sum is σ = 2304791193600. Its totient is φ = 899369733888.
The previous prime is 1451331616219. The next prime is 1451331616247. The reversal of 1451331616221 is 1226161331541.
1451331616221 is a `hidden beast` number, since 1 + 4 + 5 + 1 + 3 + 31 + 616 + 2 + 2 + 1 = 666.
It is not a de Polignac number, because 1451331616221 - 21 = 1451331616219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1451331616121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 189985920 + ... + 189993558.
It is an arithmetic number, because the mean of its divisors is an integer number (36012362400).
Almost surely, 21451331616221 is an apocalyptic number.
It is an amenable number.
1451331616221 is a deficient number, since it is larger than the sum of its proper divisors (853459577379).
1451331616221 is a wasteful number, since it uses less digits than its factorization.
1451331616221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12735 (or 12729 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
Adding to 1451331616221 its reverse (1226161331541), we get a palindrome (2677492947762).
The spelling of 1451331616221 in words is "one trillion, four hundred fifty-one billion, three hundred thirty-one million, six hundred sixteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •